Per-membership-count item totals.
Details
Given a binary item \(\times\) set matrix (rows = items, columns = sets, cells in \(\{0, 1\}\)), returns a named integer vector keyed by k = 1..n_sets giving the number of items belonging to exactly k sets. All bins are present even when their count is zero. Rows that sum to zero are skipped (universe-rule violation; defensive).