Rowmotion on fences

Abstract

A fence is a poset with elements F = x1, x2, ..., xn and covers x1 < x2 < ... < xa > xa+1 > ... > xb < xb+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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…