Orbits of antichains in certain root posets
Chao-Ping Dong, Suijie Wang

TL;DR
This paper provides an alternative proof for the average antichain size in certain posets, extends the result to new posets, and suggests a broader root poset framework for the homomesy phenomenon.
Contribution
It introduces a new proof method for antichain averages and extends the results to additional root posets, proposing a unified root poset setting for homomesy.
Findings
Average antichain size in $[m]\times [n]$ orbits is $\frac{mn}{m+n}$
Average size in $[m]\times K_{n-1}$ orbits is $\frac{2mn}{m+2n-1}$
Root posets may unify the understanding of homomesy phenomenon
Abstract
This paper gives another proof of Propp and Roby's theorem saying that the average antichain size in any reverse operator orbit of the poset is . It is conceivable that our method should work for other situations. As a demonstration, we show that the average size of antichains in any reverse operator orbit of equals . Here is the minuscule poset . Note that and can be interpreted as sub-families of certain root posets. We guess these root posets should provide a unified setting to exhibit the homomesy phenomenon defined by Propp and Roby.
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.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Topics in Algebra
