Path counting and rank gaps in differential posets
Christian Gaetz, Praveen Venkataramana

TL;DR
This paper investigates the size gaps between consecutive ranks in differential posets, introducing a path-based projection operator to establish new lower bounds and analyze structural subcomponents.
Contribution
It extends Miller's result by proving that rank gaps are at least twice the differential parameter, and develops a path counting method to analyze these gaps.
Findings
Proved that $ ext{Δ} p_n ext{ } ext{≥} ext{ } 2r$ for differential posets.
Introduced a projection operator based on path counting in the Hasse diagram.
Derived stronger bounds when the poset contains many threads.
Abstract
We study the gaps between consecutive rank sizes in -differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen Miller's result that , which resolved a longstanding conjecture of Stanley, by showing that . We also obtain stronger bounds in the case that the poset has many substructures called threads.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
