I heard from Dan Romik and Richard Stanley about a very exciting development in enumerative combinatorics. It is quite amazing how new uncharted sections of the gold mine of tableaux, hooks, partitions, and permutations are repeatedly being discovered. Guo-Niu HAN proved the following:

Here, the first sum runs over all partitions of n, is the number of standard young tableaux corresponding to , and the second sum runs over all hook lengths of the Ferrers diagram corresponding to . Of course, this formula reminds us of the classical result , and of the hook formula for the value of itself.

Han’s result is one of many exciting other applications of a recent remarkable formula for Euler’s product raised to an arbitrary complex power , via an expansion based on tableaux. This later formula was first discovered by Nekrasov and Okounkov in the context of Seiberg-Witten theory, and was later rediscovered by Han himself who provided another proof, and presented many remarkable applications. It also gives new proofs and new perspectives to several classical formulas regarding powers of Euler products going back to Euler himself, Jacobi, Ramanujan, and more recently, Macdonald, Kostant and many others.

**Added July 11, long overdue:** Dan showed me the actual general Nekrasov-Okounkov’s formula, hints regarding Han’s proof, and how the marked hook formula is derived. The general formula for powers of Euler products goes like this: The proof relies on a formula of Macdonald for the case that and is an odd integer. Macdonald found a beautiful expansion in this case of the form , where referred to as “t-coding” meaning that the sum of all is 0 modulo t, and . Anyway, once the “hook expansion” is derived using Macdonald’s formula for the spaciel case of squares of odd integers it extends automatically to all . The marked hook formula is derived by looking at the coefficients of .

**Update** (July 17 ): Dominique Foata brought to my attention a special web page on these developments.