Rowmotion on fences
Sergi Elizalde, Matthew Plante, Tom Roby, Bruce E. Sagan
Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.