Reductions of Young Tableau Bijections

Authors:
Igor Pak;Ernesto Vallejo
Affiliations:
pak@math.umn.edu;vallejo@matmor.unam.mx
Venue:
SIAM Journal on Discrete Mathematics
Year:
2010

Citing 8
Cited 0

Dual equivalence with applications, including a conjecture of Proctor

Discrete Mathematics - Special volume: algebraic combinatorics
Triple Multiplicities for sl(r + 1) and the Spectrum of the Exterior Algebra of the Adjoint Representation

Journal of Algebraic Combinatorics: An International Journal
Tableau switching: algorithms and applications

Journal of Combinatorial Theory Series A
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Combinatorics and geometry of Littlewood-Richardson cones

European Journal of Combinatorics - Special issue on combinatorics and representation theory
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients

Journal of Algebraic Combinatorics: An International Journal
Perfect matchings and the octahedron recurrence

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.