The Whitney Duals of a Graded Poset
Rafael S. Gonz\'alez D'Le\'on, Joshua Hallam

TL;DR
This paper introduces Whitney duals of graded posets, providing a construction method, exploring their properties, and demonstrating their existence for various important classes of posets, with applications in combinatorics and algebra.
Contribution
It defines Whitney duals and Whitney labelings, proves their existence for posets with Whitney labelings, and applies these concepts to several well-studied posets, including geometric lattices and noncrossing partitions.
Findings
Every graded poset with a Whitney labeling has a Whitney dual.
Explicit construction of Whitney duals using quotient posets.
Applications to geometric lattices, noncrossing partitions, and weighted partitions.
Abstract
We introduce the notion of a \emph{Whitney dual} of a graded poset. Two posets are Whitney duals to each other if (the absolute value of) their Whitney numbers of the first and second kind are interchanged between the two posets. We define new types of edge and chain-edge labelings which we call \emph{Whitney labelings}. We prove that every graded poset with a Whitney labeling has a Whitney dual. Moreover, we show how to explicitly construct a Whitney dual using a technique involving quotient posets. As applications of our main theorem, we show that geometric lattices, the lattice of noncrossing partitions, the poset of weighted partitions studied by Gonz\'alez D'Le\'on-Wachs, and most of the RS-labelable posets studied by Simion-Stanley all have Whitney duals. Our technique gives a combinatorial description of a Whitney dual of the noncrossing partition lattice in terms of a…
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.
