Discrete Mathematics & Theoretical Computer Science |

Various authors have studied a natural operation (under various names) on the order ideals (equivalently antichains) of a finite poset, here called \emphrowmotion. For certain posets of interest, the order of this map is much smaller than one would naively expect, and the orbits exhibit unexpected properties. In very recent work (inspired by discussions with Berenstein) Einstein and Propp describe how rowmotion can be generalized: first to the piecewise-linear setting of order polytopes, then via detropicalization to the birational setting. In the latter setting, it is no longer \empha priori clear even that birational rowmotion has finite order, and for many posets the order is infinite. However, we are able to show that birational rowmotion has the same order, p+q, for the poset P=[p]×[q] (product of two chains), as ordinary rowmotion. We also show that birational (hence ordinary) rowmotion has finite order for some other classes of posets, e.g., the upper, lower, right and left halves of the poset above, and trees having all leaves on the same level. Our methods are based on those used by Volkov to resolve the type AA (rectangular) Zamolodchikov Periodicity Conjecture.

Source: HAL:hal-01207567v1

Volume: DMTCS Proceedings vol. AT, 26th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2014)

Section: Proceedings

Published on: January 1, 2014

Imported on: November 21, 2016

Keywords: antichains,birational actions,birational rowmotion,Brouwer-Schrijver map,cluster algebras,orbit,order ideals,Panyushev complementation,poset,product of chains,promotion,rowmotion,toggle group,Zamolodchikov conjecture.,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Funding:

- Source : OpenAIRE Graph
*Deterministic analogues of random processes*; Funder: National Science Foundation; Code: 1001905

This page has been seen 224 times.

This article's PDF has been downloaded 488 times.