Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Institution: Ruhr University Bochum
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7204586991