Type: Article
Publication Date: 2010-01-01
Citations: 32
DOI: https://doi.org/10.1137/070689784
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of studying 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.