Reductions of Young tableau bijections
Igor Pak, Ernesto Vallejo
TL;DR
This paper introduces linear reduction and equivalence concepts to unify and analyze classical bijections between Young tableaux, establishing formal connections among them.
Contribution
It presents a unified framework for classical Young tableau bijections using linear reduction and equivalence, originating from theoretical computer science.
Findings
Unified view of classical bijections
Formal connections established between bijections
Framework facilitates comparison and analysis
Abstract
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a number of classical bijections, and establish formal connections between them.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Topics in Algebra · Advanced Algebra and Geometry