0
$\begingroup$

Say I have a multiset with (potentially) duplicate items

How many ways can I split a multiset into n indistinguishable bins where each bin must have at least 1 element?

For example, say my multiset is {a,a,b,c} and I want to split it into 2 bins

{a,a,b} {c}

{a,a} {b,c}

{a} {a,b,c}

{a,b} {a,c}

{b} {a,a,c}

$\endgroup$
  • $\begingroup$ This MSE link might potentially be relevant. $\endgroup$ – Marko Riedel Oct 13 at 12:29

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.