English

Rowmotion on fences

Combinatorics 2025-04-29 v2 Group Theory

Abstract

A fence is a poset with elements F = {x_1, x_2, ..., x_n} and covers x_1 < x_2 < ... < x_a > x_{a+1} > ... > x_b < x_{b+1} < ... where a, b, ... are positive integers. We investigate rowmotion on antichains and ideals of F. In particular, we show that orbits of antichains can be visualized using tilings. This permits us to prove various homomesy results for the number of elements of an antichain or ideal in an orbit. Rowmotion on fences also exhibits a new phenomenon, which we call homometry, where the value of a statistic is constant on orbits of the same size. Along the way, we prove a general homomesy result for all self-dual posets. We end with some conjectures and avenues for future research.

Cite

@article{arxiv.2108.12443,
  title  = {Rowmotion on fences},
  author = {Sergi Elizalde and Matthew Plante and Tom Roby and Bruce Sagan},
  journal= {arXiv preprint arXiv:2108.12443},
  year   = {2025}
}

Comments

26 pages, 7 figures

R2 v1 2026-06-24T05:28:50.262Z