Skip to content

BooleanLattice ​

The poset of subsets of {1,…,n}\{1,\dots,n\} ordered by inclusion, on which MoebiusFunction gives the signs of inclusion–exclusion.

BooleanLattice(n)subsets of {1,…,n}\{1,\dots,n\} ordered by inclusion
Typed signatures
TypePackageApplies
(integer) -> expression<BooleanLattice>incidencealways

Domain: Incidence algebras

Examples

Basic #

Subsets of {1,2}\{1,2\}

live ↗
InPosetElements(BooleanLattice(2))\mathrm{PosetElements}(\mathrm{BooleanLattice}(2))Out[[],[1],[2],[1,2]]\bigl\lbrack\bigl\lbrack\bigr\rbrack, \bigl\lbrack1\bigr\rbrack, \bigl\lbrack2\bigr\rbrack, \bigl\lbrack1, 2\bigr\rbrack\bigr\rbrack

(−1)3(-1)^3

live ↗
InMoebiusFunction(BooleanLattice(3),[],[1,2,3])\mathrm{MoebiusFunction}(\mathrm{BooleanLattice}(3), \bigl\lbrack\bigr\rbrack, \bigl\lbrack1, 2, 3\bigr\rbrack)Out−1-1
About
Examples2

See also: IncidenceAlgebra, PosetElements, MoebiusFunction