A Bijective Proof of the Hook-Length Formula

@article{Franzblau1982ABP,
  title={A Bijective Proof of the Hook-Length Formula},
  author={Deborah S. Franzblau and Doron Zeilberger},
  journal={J. Algorithms},
  year={1982},
  volume={3},
  pages={317-343}
}
A well-known theorem of Frame, Robinson, and, Thrall states that if h is a partition of n, then the number of Standard Young Tableaux of shape h is n! divided by the product of the hook-lengths. We give a new combinatorial proof of this formula by exhibiting a bijection between the set of unsorted Young Tableaux of shape A, and the set of pairs (T, S), where T is a Standard Young Tableau of shape h and S is a “Pointer” Tableau of shape A. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-3 of 3 references

WILF, A probabilistic proof of a formula for the number of Young tableaux of a given shape

C. GREENE, A. NUENHUIS, S H.
Adounces in Math • 1979
View 2 Excerpts

GRASSL, Reverse plane partitions and tableau hook numbers

R.M.A.P. HILLMAN
J. Combinatorial Theory Ser. A • 1976
View 2 Excerpts

THRALL, The hook graphs of the symmetric group, Cunad

J. S. FRAME, G. DE ROBINSON, M R.
J. Math • 1954

Similar Papers

Loading similar papers…