Answers are grounded in this paper and cite their sources.
Combinatorial analysis reveals a height-gap classification for Boolean antichains in finite lattices, highlighting an exact bijection with matroid bases.
We classify Boolean antichains of every size in every finite lattice. For an ordered family, intersecting all but one member produces candidate Boolean atoms. The family is Boolean precisely when those atoms rise above the common meet and all reconstruction height gaps vanish. This criterion gives an exact finite formula for the full enumerator. A binomial transform of that enumerator is multiplicative under lattice products, yielding an explicit positive convolution. In geometric lattices, height is matroid rank and the reconstructed faces carry strictly increasing integral polymatroid rank profiles. The principal application resolves the geometric-lattice question motivating the work. For a rank-r matroid, maximum Boolean antichains in its flat lattice are naturally in bijection with bases of its simplification. In a graph this gives spanning forests and, in the connected simple case, the proposed spanning-tree bijection. Parallel classes refine the bijection to an exact decomposition of the multivariate basis polynomial; flat intervals give the corresponding minor-local and rank-tight results. The general theory also yields an all-size block formula for uniform matroids, a universal Möbius formula for Boolean pairs, complete descriptions for finite distributive and subspace lattices, and complete distributions for all finite projective planes. The product convolution transports these formulas to lattice products and matroid direct sums.
No takes yet. Share an insight, caveat, or question.
Alex Chengyu Li (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: