Interval-closed set rowmotion and homomesy on products of two chains
Nadia Lafrenière, Joel Brewster Lewis, Erin McNicholas, Jessica Striker, Amanda Welch
TL;DR
This work advances the dynamical algebraic combinatorics of rowmotion on interval-closed sets by providing a streamlined global definition and a complete orbit description for ICS on the poset $[2]\times[n]$. It delivers a precise orbit taxonomy, including sizes that divide $n+3$, $n+5$, and several quadratic-size orbits, and proves a surprising 0-mesic property for the signed cardinality statistic when $n$ is odd. The authors also establish a robust framework for calculating $\mathrm{sc}(I)$ and use it to demonstrate homomesy across all orbits in the odd-$n$ case, matching combinatorial counts with orbit structures. Beyond the main results, the paper lays out conjectures and directions for extending rowmotion analysis to general $[m]\times[n]$ and for max-minus-min homomesy, outlining both expected patterns and known counterexamples. Overall, the results illuminate rich, highly structured dynamics of ICS rowmotion on two-chains products and open routes for further exploration in higher-dimensional posets.
Abstract
We study rowmotion dynamics on interval-closed sets. Our first main result proves a simplification of the global definition of interval-closed set rowmotion from (Elder, Lafrenière, McNicholas, Striker, and Welch 2024). We then completely describe the orbits of interval-closed set rowmotion on products of two chains $[2]\times[n]$ and use this understanding to prove a homomesy conjecture from (ELMSW 2024) involving the signed cardinality statistic.
