
arXiv: math/0408171
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.
42 pages, 15 figures
20C30, 05E05 (Secondary), 05E10 (Primary), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Representation Theory (math.RT), Mathematics - Representation Theory, 05E10 (Primary); 20C30, 05E05 (Secondary)
20C30, 05E05 (Secondary), 05E10 (Primary), FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Representation Theory (math.RT), Mathematics - Representation Theory, 05E10 (Primary); 20C30, 05E05 (Secondary)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
