Reductions of Young tableau bijections
classification
🧮 math.CO
math.RT
keywords
bijectionslinearnotionsyoungallowclassicalcomputerconnections
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.