Hook length formula and geometric combinatoricsIgor PakMIT
October 3,

ABSTRACT


I will give a geometric proof of the hook length formula for the number of standard Young tableaux of a given shape. We reduce the problem to an equality of the integer volumes of two polytopes. The latter is proved directly by an explicit continuous volumepreserving map. The talk assumes no background whatsoever. With some luck, this will be the most transparent proof of the hook length formula you have ever seen... The paper is published here: Séminaire Lotharingien de Combinatoire, vol. 46 (2001), article B46f, 13 pp. 
Combinatorics Seminar, Mathematics Department, MIT, sara(atsign)math.mit.edu 

