Birational rowmotion on a rectangle over a noncommutative ring
Abstract
We extend the periodicity of birational rowmotion for rectangular posets to the case when the base field is replaced by a noncommutative ring (under appropriate conditions). This resolves a conjecture from 2014. The proof uses a novel approach and is fully self-contained. Consider labellings of a finite poset by elements of a ring : one label associated with each poset element and two constant labels for the added top and bottom elements in . *Birational rowmotion* is a partial map on such labellings. It was originally defined by Einstein and Propp for as a lifting (via detropicalization) of *piecewise-linear rowmotion*, a map on the order polytope . The latter, in turn, extends the well-studied rowmotion map on the set of order ideals (or more properly, the set of order filters) of , which correspond to the vertices of . Dynamical properties of these combinatorial maps sometimes (but not always) extend to the birational level, while results proven at the birational level always imply their combinatorial counterparts. Allowing to be noncommutative, we generalize the birational level even further, and some properties are in fact lost at this step. In 2014, the authors gave the first proof of periodicity for birational rowmotion on rectangular posets (when is a product of two chains) for a field, and conjectured that it survives (in an appropriately twisted form) in the noncommutative case. In this paper, we prove this noncommutative periodicity and a concomitant antipodal reciprocity formula. We end with some conjectures about periodicity for other posets, and the question of whether our results can be extended to (noncommutative) semirings.
Keywords
Cite
@article{arxiv.2208.11156,
title = {Birational rowmotion on a rectangle over a noncommutative ring},
author = {Darij Grinberg and Tom Roby},
journal= {arXiv preprint arXiv:2208.11156},
year = {2023}
}
Comments
72 pages. A more detailed version is available as an ancillary file. For a less detailed version, skip all proofs of something being well-defined. Comments are welcome! v4 corrects some minor bugs. Accepted at Combinatorial Theory, no editorial formatting