Counting Boolean Antichains
Julien Garber, Lina S. Goltermann, Daniel Horiatakis, Dennis König, Tal Gottesman
Source abstract
We say that an antichain in a lattice $L$ is Boolean if it generates a Boolean sublattice in $L$ in a particularly nice way. These purely combinatorial objects play a role in the representation theory of the incidence algebra of the lattice $L$, as indicated by recent results of Rognerud, Yıldırım and of the last author with Klász, Kleinau and Marczinzik. Given these motivations, it is natural to ask: Can we count and construct Boolean antichains in certain lattices? In this paper we give a construction of Boolean antichains in Boolean lattices, partition lattices and Tamari lattices. Furthermore, we share the surprisingly elegant formulas we found for the number of these Boolean antichains.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.