Abstract
Rectangular standard Young tableaux with 2 or 3 rows are in bijection with \(U_q(\mathfrak {sl}_2)\)-webs and \(U_q(\mathfrak {sl}_3)\)-webs, respectively. When \(\mathcal {W}\) is a web with a reflection symmetry, the corresponding tableau \(T_\mathcal {W}\) has a rotational symmetry. Folding \(T_\mathcal {W}\) transforms it into a domino tableau \(D_\mathcal {W}\). We study the relationships between these correspondences. For 2-row tableaux, folding a rotationally symmetric tableau corresponds to “literally folding” the web along its axis of symmetry. For 3-row tableaux, we give simple algorithms, which provide direct bijective maps between symmetrical webs and domino tableaux (in both directions). These details of these algorithms reflect the intuitive idea that \(D_\mathcal {W}\) corresponds to “\(\mathcal {W}\) modulo symmetry”.
Similar content being viewed by others
References
W. Fulton. Young tableaux: with applications to representation theory and geometry. London Mathematical Society Student Texts. Cambridge University Press, 1997.
M. Haiman. On mixed insertion, symmetry, and shifted Young tableaux. J. Combin. Theory Ser. A., 50(2):196–225, 1989.
M. Khovanov and G. Kuperberg. Web bases for sl(3) are not dual canonical. Pacific J. Math, 188(1):129–153, 1999.
G. Kuperberg. Spiders for rank 2 Lie algebras. Comm. Math. Phys., 180(1):109–151, 1996.
R. Patrias, O. Pechenik. Tableau evacuation and webs. Preprint. arXiv:2109.04989 [math].
T. K. Petersen, P. Pylyavskyy, and B. Rhoades. Promotion and cyclic sieving via webs. J. Alg. Combin., 30(1):19–41, 2009.
K. Purbhoo. Wronskians, cyclic group actions, and ribbon tableaux. Trans. Amer. Math. Soc., 365(4):1977–2030, 2013.
K. Purbhoo. A marvellous embedding of the Lagrangian Grassmannian. J. Combin. Theory Ser. A., 155:1–26, 2018.
M. P. Schützenberger. La correspondence de Robinson. In Lecture notes in Math, volume 579, pages 59–113. Springer–Verlag, 1977.
R. P. Stanley. Promotion and evacuation. Elec. J. Combin., 16(2):R9 (electronic), 2009.
J. Tymoczko. A simple bijection between standard \(3 \times n\) tableaux and irreducible webs for \({\mathfrak{sl}}_ {3}\). Journal of Algebraic Combinatorics, 35(4):611–632, 2012.
M. van Leeuwen. The Robinson-Schensted and Schützenberger algorithms, an elementary approach. Elec. J. Combin., 3(2), 1996.
Acknowledgements
The authors would like to thank Oliver Pechenik for the helpful feedback on the first version of this manuscript.
Funding
The work of Kevin Purbhoo was supported by NSERC Discovery Grants RGPIN-355462 and RGPIN-04741-2018. The work of Shelley Wu was supported by NSERC Undergraduate Student Research Award.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors declare that there are no conflicts of interest.
Additional information
Communicated by Bridget Tenner.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Purbhoo, K., Wu, S. Folding Rotationally Symmetric Tableaux via Webs. Ann. Comb. 28, 93–119 (2024). https://doi.org/10.1007/s00026-023-00648-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-023-00648-0