Loading [MathJax]/jax/output/HTML-CSS/jax.js
Ask Your Question

Revision history [back]

click to hide/show revision 1
initial version

asked 3 years ago

klaaa gravatar image

Subposets of the Boolean lattice via Sage

Let Bn be the Boolean lattice of a set with n elements. Is there a quick method via Sage to obtain all subposets P of Bn containing the empty set and having the property that with x in P also the complement of the set x is in P and such that with x and y in P also the union of x and y is in P if x and y are disjoint?

Thanks for any help

Subposets of the Boolean lattice via Sage

Let Bn be the Boolean lattice of a set with n elements. Is there a quick method via Sage to obtain all subposets P of Bn containing the empty set and having the property that with x in P also the complement of the set x is in P and such that with x and y in P also the union of x and y is in P if x and y are disjoint?

disjoint? (probably this works only for small n but n6 would already be interesting) Thanks for any help