Birational Rowmotion and Coxeter-Motion on Minuscule Posets

Birational rowmotion is a discrete dynamical system on the set of all positive real-valued functions on a finite poset, which is a birational lift of combinatorial rowmotion on order ideals. It is known that combinatorial rowmotion for a minuscule poset has order equal to the Coxeter number, and exhibits the file homomesy phenomenon for refined order ideal cardinality statistics. In this paper we generalize these results to the birational setting. Moreover, as a generalization of birational promotion on a product of two chains, we introduce birational Coxeter-motion on minuscule posets, and prove that it enjoys periodicity and file homomesy.

Homomesy in Products of Three Chains and Multidimensional Recombination

J. Propp and T. Roby isolated a phenomenon in which a statistic on a set has the same average value over any orbit as its global average, naming it homomesy. They proved that the cardinality statistic on order ideals of the product of two chains poset under rowmotion exhibits homomesy. In this paper, we prove an analogous result in the case of the product of three chains where one chain has two elements. In order to prove this result, we generalize from two to n dimensions the recombination technique that D. Einstein and Propp developed to study homomesy. We see that our main homomesy result does not fully generalize to an arbitrary product of three chains, nor to larger products of chains; however, we have a partial generalization to an arbitrary product of three chains. Additional corollaries include refined homomesy results in the product of three chains and a new result on increasing tableaux. We conclude with a generalization of recombination to any ranked poset and a homomesy result for the Type B minuscule poset cross a two element chain.

Orbits of Antichains in Certain Root Posets

Building everything from scratch, we give 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.