User:TestFunction/sandbox

In combinatorial mathematics, the hook-length formula gives d_λ, the number of Young tableau of shape λ, in terms of (a product of) the hook-lengths of λ. It has applications in diverse areas such as probability, algebraic geometry, group theory, representation theory, and algorithm analysis; for example, the problem of longest increasing subsequences.

Let λ = {λ₁,λ₂,…,λ_m} be a partition of n. That is, λ₁,λ₂,…,λ_m are positive integers such that n = λ₁ + λ₂ + … + λ_m and λ₁ ≥ λ₂ ≥ … ≥ λ_m. Then the Young diagram of shape λ, denoted Y(λ), is an array of cells with indices (i,j) where 1 ≤ i ≤ m and 1 ≤ j ≤ λ_i. The Young diagram of shape λ has n cells and has a natural bijection to a partition of n. A standard Young tableau of shape λ is a Young diagram of shape λ in which each of the n cells contains a distinct integer between 1 and n (i.e., no repetition), such that each row and each column form increasing sequences. For each cell (i,j) of Y(λ), the hook H_λ(i,j) is the set of all cells (a,b) such that a=i and b≥j or a≥i and b=j. The hook-length h_λ(i,j) is |H_λ(i,j)|, the number of cells in the hook H_λ(i,j).

Then the hook-length formula is

$d_{\lambda }={\frac {n!}{\prod _{(i,j)\in Y(\lambda )}h_{\lambda }(i,j)}}.$

There are other formulas for d_λ, but the hook-length formula is particularly simple. Indeed, the hook-length formula was discovered in 1954 by J. S. Frame, G. de B. Robinson, and R. M. Thrall by improving a less convenient determinant formula for d_λ. This earlier formula was deduced independently by G. Frobenius and A. Young in 1900 and 1902 respectively using algebraic methods. P. A. MacMahon found an alternate proof for the Young-Frobenius formula in 1916 using difference methods.

Since its discovery in 1954, many alternate proofs for the hook-length formula have been found, particularly because no simple explanation had been found despite such a simple result. Hillman and Grassl gave the first proof that illuminates the role of hooks in 1976 by proving a special case of the Stanley hook-content formula, which is known to imply the hook-length formula. Inspired by this result, C. Greene, A. Nijenhuis, and H. S. Wilf found a probabilistic proof in which the hook lengths appear naturally in 1979. D. Zeilberger converted the Greene-Nijenhuis-Wilf proof into a bijective proof in 1984. Meanwhile, Remmel adapted the original Frame-Robinson-Thrall proof based on the Young-Frobenius proof into the first bijective proof in 1982. A direct bijective proof was first discovered by D. S. Franzblau and D. Zeilberger in 1982. A simpler direct bijective proof was announced by Igor Pak and Alexander V. Stoyanovskii in 1992, and its complete proof was presented by the pair and Jean-Christophe Novelli in 1997.

The hook-length formula has been generalized in several different ways. Sagan and Yeh found and proved hook-length formulas for shifted Young Tableaux and binary trees, respectively?. Some proofs for the basic hook-length formula extend to their generalizations.

References

Despite the simplicity of the hook-length formula, initially it was not even clear why hooks appeared in the formula. Thus there were many attempts to find a simpler proof, resulting in many alternate, more intuitive proofs. was an urge to develop

Since its discovery in 1954, many alternate proofs for the hook-length formula have been found, particularly because no simple proof has been found despite/for such a simple result. (cite Knuth) (( in the quest for a shorter and more intuitive proof. Despite the simplicity of the hook-length formula, initially it was not clear why hooks appeared in the formula. ))

Knuth wrote in 1973, “Since the hook-lengths formula is such a simple result, it deserves a simple proof ...”

since then there were many attempts to find a simpler proof (simplify proof)

Hillman and Grassl provided in 1976 proof uses hooks in a natural way to derive a combinatorial correspondence involving plane partitions, from which the Frame-Robinson-Thrall formula can be derived by an asymptotic argument.

Stanley 1972 Hillman and Grassl provided in 1976 proof uses hooks in a natural way to derive a combinatorial correspondence involving plane partitions, from which the Frame-Robinson-Thrall formula can be derived by an asymptotic argument.

For the latter, the bijection without the complete proof was announced in 1992 by presented fully proven its proof was fully preseneted complete proof was presented

In combinatorial mathematics, the hook-length formula is … (a few paragraphs explaining what it's about, who proved it and when).

copy

Since its discovery in 1954, many alternate proofs for the hook-length formula have been found, particularly because no simple proof has been found despite/for such a simple result. (cite Knuth) (( in the quest for a shorter and more intuitive proof. Despite the simplicity of the hook-length formula, initially it was not clear why hooks appeared in the formula. )) Hillman and Grassl gave the first proof that illuminates the role of hooks in 1976 (via a combinatorial bijection). They proved a special case of the Stanley hook-content formula, which is known to imply the hook-length formula. Inspired by this result, C. Greene, A. Nijenhuis, and H. S. Wilf found a probabilistic proof in which the hook lengths appear naturally in 1979. D. S. Franzblau and D. Zeilberger converted this proof into the first direct bijective proof in 1982. A direct bijective proof was first discovered by D. S. Franzblau and D. Zeilberger in 1982. Meanwhile, Remmel adapted the original Young-Frobenius proof and Frame-Robinson-Thrall proof into the first bijective proof in 1982. A simpler bijective proof was announced by Igor Pak and Alexander V. Stoyanovskii in 1992, and its complete proof was presented by the pair and Jean-Christophe Novelli in 1997.

Meanwhile, the hook-length formula has been generalized and extended in several different ways. Sagan and Yeh found and proved hook-length formulas for shifted Young Tableaux and binary trees.