Orbits of antichains in certain root posets
classification
🧮 math.CO
keywords
timesposetsrootantichainsaveragecertainfracoperator
read the original 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]\times [n]$ is $\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]\times K_{n-1}$ equals $\frac{2mn}{m+2n-1}$. Here $K_{n-1}$ is the minuscule poset $[n-1]\oplus ([1] \sqcup [1]) \oplus [n-1]$. Note that $[m]\times [n]$ and $[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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.