English

Orbits of antichains in certain root posets

Combinatorics 2017-10-17 v3

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 [m]×[n][m]\times [n] is mnm+n\frac{mn}{m+n}. 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 [m]×Kn1[m]\times K_{n-1} equals 2mnm+2n1\frac{2mn}{m+2n-1}. Here Kn1K_{n-1} is the minuscule poset [n1]([1][1])[n1][n-1]\oplus ([1] \sqcup [1]) \oplus [n-1]. Note that [m]×[n][m]\times [n] and [m]×Kn1[m]\times K_{n-1} 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.

Cite

@article{arxiv.1606.05715,
  title  = {Orbits of antichains in certain root posets},
  author = {Chao-Ping Dong and Suijie Wang},
  journal= {arXiv preprint arXiv:1606.05715},
  year   = {2017}
}

Comments

17 pages, type D handled

R2 v1 2026-06-22T14:28:24.447Z