Reductions of Young tableau bijections
Igor Pak, Ernesto Vallejo
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.
Create a lesson
Related papers
Szemerédi's theorem with random differences and arithmetic Kakeya
Gabriel Dahia
A proof of the rational exponents conjecture
David Conlon, Oliver Janzer, Tao Jiang et al.
Proofs of four Takigiku--Tsuchioka conjectures on level 2 principal characters of A2-1(2)
Liuquan Wang
Two conjectures on the cospectrality of complete tripartite graphs are false
Irena M. Jovanović, Jelena Sedlar, Riste Škrekovski
Saturation and semisaturation of oriented graphs
Vladimir Bošković, Balázs Keszegh
Spectral radius and edge-disjoint spanning trees of graphs with edge connectivity
Jia Wei, Muhuo Liu, Zhifu You et al.