3
$\begingroup$

Suppose we have a finite collection of sets $A_1$,...,$A_n$. Is there an algorithm which gives a new collection $B_1$,...,$B_m$, which consist of pairwise disjoint sets, $\cup B_i=\cup A_j$ and each $B_i$ is a subset of some $A_j$?

$\endgroup$
7
$\begingroup$

Write $B_k=A_k\setminus\bigcup_{j<k}A_j$. It might be the case that several of the sets will end up as being empty. Remove those.

$\endgroup$

Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.