Hook Length Formula and Geometric Combinatorics

Hook Length Formula and Geometric Combinatorics (2000)

Cached

Download Links

[www-math.mit.edu]

by Igor Pak

Venue:	Lothar. Comb
Citations:	8 - 5 self

BibTeX

@ARTICLE{Pak00hooklength,
    author = {Igor Pak},
    title = {Hook Length Formula and Geometric Combinatorics},
    journal = {Lothar. Comb},
    year = {2000},
    volume = {46},
    pages = {4--6}
}

Bookmark

OpenURL

Abstract

We present here a transparent proof of the hook length formula. The formula is reduced to an equality between the number of integer point in certain polytopes. The latter is established by an explicit continuous volume-preserving piecewise linear map.

Citations

1813	The Art of Computer Programming - Knuth - 1968
710	Symmetric functions and Hall polynomials - MacDonald - 1995
189	The Symmetric Group: Representations, combinatorial algorithms, and symmetric functions - Sagan - 1991
162	matrices, and generalized Young tableaux - Knuth, Permutations - 1970
139	Longest increasing and decreasing subsequences - Schensted - 1961
122	The Representation Theory of the Symmetric - James, Kerber - 1981
92	Ordered structures and partitions - Stanley - 1972
54	An extension of Schensted’s theorem - Greene - 1974
45	The hook graphs of the symmetric group - Frame, Robinson, et al. - 1954
36	Groups generated by involutions, Gelfand-Tsetlin patterns and combinatorics of Young tableaux, Algebra i Analiz 7 - Berenstein, Kirillov - 1995
32	Theory and applications of plane partitions - Stanley - 1971
25	A probabilistic proof of a formula for the number of Young tableaux of a given shape - Greene, Nijenhuis, et al. - 1979
20	Generalized quotients in Coxeter groups - Björner, Wachs - 1988
20	Representation theory of the symmetric group - Robinson - 1961
15	Reverse plane partitions and tableau hook numbers - Hillman, Grassl - 1976
8	Matrix correspondences of plane partitions - Gansner - 1981
8	The Hillman-Grassl correspondence and the enumeration of reverse plane partitions - Gansner - 1981
7	A bijective proof of the hook-length formula - Franzblau, Zeilberger - 1982
7	Ribbon tile invariants, Trans - Pak
4	Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted - Krattenthaler - 1995
2	Duality of graded graphs; Schensted algorithms for dual graded graphs - Fomin - 1994
2	Oscillating tableaux and generalized RSK correspondence - Pak, Postnikov - 1996
1	A direct combinatorial proof of the hook-length formula, Discrete - Novelli, Pak, et al. - 1997
1	Four questions on Birkho polytope - Pak