Paths to understanding birational rowmotion on products of two chains

Gregg Musiker, Tom Roby

Research output: Contribution to journalArticlepeer-review

Abstract

Birational rowmotion is an action on the space of assignments of rational functions to the elements of a finite partially-ordered set (poset). It is lifted from the well-studied rowmotion map on order ideals (equivalently on antichains) of a poset P, which when iterated on special posets, has unexpectedly nice properties in terms of periodicity, cyclic sieving, and homomesy (statistics whose averages over each orbit are constant). In this context, rowmotion appears to be related to Auslander–Reiten translation on certain quivers, and birational rowmotion to Y -systems of type Am × An described in Zamolodchikov periodicity. We give a formula in terms of families of non-intersecting lattice paths for iterated actions of the birational rowmotion map on a product of two chains. This allows us to give a much simpler direct proof of the key fact that the period of this map on a product of chains of lengths r and s is r + s + 2 (first proved by D. Grinberg and the second author), as well as the first proof of the birational analogue of homomesy along files for such posets.

Original languageEnglish (US)
Pages (from-to)275-304
Number of pages30
JournalAlgebraic Combinatorics
Volume2
Issue number2
DOIs
StatePublished - 2019

Bibliographical note

Publisher Copyright:
© The journal and the authors, 2019.

Keywords

  • Birational rowmotion
  • Dynamical algebraic combinatorics
  • Homomesy
  • Periodicity
  • Toggling

Fingerprint

Dive into the research topics of 'Paths to understanding birational rowmotion on products of two chains'. Together they form a unique fingerprint.

Cite this