Iterative properties of birational rowmotion. II: Rectangles and triangles. (English) Zbl 1339.06001

Summary: Birational rowmotion – a birational map associated to any finite poset \(P\) – has been introduced by Einstein and Propp as a far-reaching generalization of the (well-studied) classical rowmotion map on the set of order ideals of \(P\). Continuing our exploration of this birational rowmotion [for part I see ibid. 23, No. 1, Research Paper P1.33 (2016; Zbl 1338.06003)], we prove that it has order \(p+q\) on the \((p, q)\)-rectangle poset (i.e., on the product of a \(p\)-element chain with a \(q\)-element chain); we also compute its orders on some triangle-shaped posets. In all cases mentioned, it turns out to have finite (and explicitly computable) order, a property it does not exhibit for general finite posets (unlike classical rowmotion, which is a permutation of a finite set). Our proof in the case of the rectangle poset uses an idea introduced by A. Yu. Volkov [Commun. Math. Phys. 276, No. 2, 509-517 (2007; Zbl 1136.82011)] to prove the \(AA\) case of the Zamolodchikov periodicity conjecture; in fact, the finite order of birational rowmotion on many posets can be considered an analogue to Zamolodchikov periodicity. We comment on suspected, but so far enigmatic, connections to the theory of root posets.


06A07 Combinatorics of partially ordered sets
05E99 Algebraic combinatorics
Full Text: arXiv Link


[1] Drew Armstrong, Christian Stump and Hugh Thomas, A uniform bijection between nonnesting and noncrossing partitions, Trans. Amer. Math. Soc. 365 (2013), pp. 4121-4151,doi:10.1090/S0002-9947-2013-05729-7.arXiv:1101.1277v2. · Zbl 1271.05011
[2] Andries E. Brouwer and A. Schrijver, On the period of an operator, defined on antichains, Math. Centr. report ZW24, Amsterdam (Jun. 1974). http://www.win.tue.nl/ aeb/preprints/zw24.pdf. · Zbl 0282.06003
[3] Peter J. Cameron, Dmitry G. Fon-der-Flaass, Orbits of Antichains Revisited, European Journal of Combinatorics, vol. 16, Issue 6, November 1995, pp. 545-554. http://www.sciencedirect.com/science/article/pii/0195669895900365.
[4] David Einstein, James Propp, Combinatorial, piecewise-linear, and birational homomesy for products of two chains,arXiv:1310.5294v1(preliminary version), October 20, 2013. · Zbl 1465.05194
[5] David Einstein, James Propp, Piecewise-linear and birational toggling, (extended abstract) DMTCS proc. FPSAC 2014. A preprint appears asarXiv:1404.3455v1. · Zbl 1394.06005
[6] Dmitry G. Fon-der-Flaass, Orbits of Antichains in Ranked Posets, European Journal of Combinatorics, vol. 14, Issue 1, January 1993, pp. 17-22. http://www.sciencedirect.com/science/article/pii/S0195669883710036. · Zbl 0777.06002
[7] Darij Grinberg, Tom Roby, The order of birational rowmotion, (extended abstract) DMTCS proc. FPSAC 2014. (This is an extended abstract, presented at the FPSAC 2014 conference, of the paper you are reading.) http://web.mit.edu/ darij/www/algebra/ipbrFPSAC6.pdf. · Zbl 1394.06006
[8] Darij Grinberg, Tom Roby, Iterative properties of birational rowmotion I: generalities and skeletal posets, 2014, submitted to Electronic Journal of Combinatorics. · Zbl 1338.06003
[9] Darij Grinberg, Tom Roby, Iterative properties of birational rowmotion, arXiv:1402.6178v5(preprint), 2015. · Zbl 1339.06001
[10] Mark D. Haiman, Dual equivalence with applications, including a conjecture of Proctor, Discrete Mathematics, Volume 99, Issues 1-3, 2 April 1992, pp. 79-113. http://www.sciencedirect.com/science/article/pii/0012365X9290368P. · Zbl 0760.05093
[11] Anatol N. Kirillov, Introduction to tropical combinatorics, Physics and combinatorics: Proceedings of the Nagoya 2000 International Workshop, held 21 - 26 August 2000 in Nagoya University. Edited by Anatol N Kirillov (Nagoya University) & Nadejda Liskova. Published by World Scientific Publishing Co. Pte. Ltd., 2001. ISBN #9789812810007, pp. 82-150. · Zbl 0989.05127
[12] A. N. Kirillov, A. D. Berenstein, Groups generated by involutions, GelfandTsetlin patterns, and combinatorics of Young tableaux, Algebra i Analiz, volume 7 (1995), issue 1, pp. 92-152. A preprint is available at: http://math.uoregon.edu/\char126\relaxarkadiy/bk1.pdf. · Zbl 0848.20007
[13] S. L. Kleiman, Dan Laksov, Schubert calculus, The American Mathematical Monthly, vol. 79, no. 10 (December 1972), pp. 1061-1082. the electronic journal of combinatorics 22(3) (2015), #P3.4047 · Zbl 0272.14016
[14] Marc van Leeuwen, The Littlewood-Richardson Rule, and Related Combinatorics, Mathematical Society of Japan Memoirs, Volume 11, 2001, pp. 95-145. Possibly newer version at:http://www-math.univ-poitiers.fr/ maavl/pdf/lrr.pdf. · Zbl 0991.05101
[15] Neil O’Connell, Timo Sepp¨al¨ainen, Nikos Zygouras, Geometric RSK correspondence, Whittaker functions and symmetrized random polymers, Inventiones Mathematicae, October 2013,doi:10.1007/s00222-013-0485-9. An older preprint version is also available asarXiv:1210.5126v2June 6, 2013.
[16] Dmitri I. Panyushev, On orbits of antichains of positive roots, Europ. J. Combin. 30 (2009), no. 2, pp. 586-594. Also available atarXiv:0711.3353v2. · Zbl 1165.06001
[17] Alexander Postnikov, Total positivity, Grassmannians, and networks, October 17, 2007 version.http://math.mit.edu/ apost/papers/tpgrass.pdf.
[18] James Propp and Tom Roby, Homomesy in products of two chains, The Electronic Journal of Combinatorics, Volume 22, Issue 3 (2015), Paper #P3.4. A preprint appeared asarXiv:1310.5201v6. · Zbl 1319.05151
[19] James Propp and Tom Roby, Homomesy in products of two chains, (extended abstract) DMTCS proc. FPSAC 2013,http://www.dmtcs.org/dmtcs-ojs/index. php/proceedings/article/view/dmAS0180/4290. · Zbl 1285.05012
[20] Brendon Rhoades, Cyclic sieving, promotion, and representation theory, J. Combin. Theory Ser. A, vol. 117, no. 1, (2010), pp. 38-76. http://www.sciencedirect.com/science/article/pii/S0097316509000703. Also available asarXiv:1005.2568v1. · Zbl 1230.05289
[21] David B Rush, XiaoLin Shi, On Orbits of Order Ideals of Minuscule Posets, Journal of Algebraic Combinatorics, May 2013, Volume 37, Issue 3, pp. 545-569. Also available asarXiv:1108.5245v2 · Zbl 1284.06008
[22] Heather M. Russell, An explicit bijection between semistandard tableaux and non-elliptic sl3webs, Journal of Algebraic Combinatorics 38.4 (2013), pp. 851-862. Also appears asarXiv:1204.1037v1 [S+09] W. A. Stein et al., Sage Mathematics Software (Version 6.2.beta2), The Sage Development Team, 2014,http://www.sagemath.org. · Zbl 1280.05135
[23] The Sage-Combinat community, Sage-Combinat: enhancing Sage as a toolbox for computer exploration in algebraic combinatorics, 2008. http://combinat.sagemath.org
[24] Richard Stanley, Two Poset Polytopes, Discrete & Computational Geometry, 1986, Volume 1, Issue 1, pp. 9-23. · Zbl 0595.52008
[25] Richard Stanley, Enumerative Combinatorics, volume 1, 2nd edition, Cambridge University Press 2011.http://math.mit.edu/ rstan/ec/ec1/
[26] John R. Stembridge, Trapezoidal Chains and Antichains, European Journal of Combinatorics, Volume 7, Issue 4, October 1986, pp. 377-387. http://www.sciencedirect.com/science/article/pii/S0195669886800099 the electronic journal of combinatorics 22(3) (2015), #P3.4048 · Zbl 0641.06001
[27] Jessica Striker, Nathan Williams, Promotion and Rowmotion, European Journal of Combinatorics 33 (2012), pp. 1919-1942, DOI 10.1016/j.ejc.2012.05.003. http://www.sciencedirect.com/science/article/pii/S0195669812000972 Also available asarXiv:1108.1172v3. · Zbl 1260.06004
[28] Hugh Thomas, Alexander Yong, Cominuscule tableau combinatorics, preprint 2013http://www.math.uiuc.edu/ ayong/DE.Japan.0730.ps. · Zbl 1380.05199
[29] Alexandre Yu. Volkov, On the Periodicity Conjecture for Y-systems, Commun. Math. Phys. 276 (2007), pp. 509-517, DOI 10.1007/s00220-007-0343-y. A preprint of this paper is also available under the name On Zamolodchikov’s Periodicity Conjecture asarXiv:hep-th/0606094v1 · Zbl 1136.82011
[30] Nathan Williams, Cataland, dissertation at University of Minnesota, August 2013.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.