フック長の公式

数学の組合せ論において、フック長の公式（フックちょうのこうしき、英語: Hook length formula）とは、与えられたヤング図形の形をした標準盤を数える公式である。表現論や、確率論、アルゴリズム解析などの多種多様な分野に応用があり、最長増加部分列問題（英語版）などが例としてあげられる。 Let λ = ( λ 1 , … , λ m ) {\displaystyle \lambda =(\lambda _{1},\ldots ,\lambda _{m})} be a partition of n {\displaystyle n} . It is customary to interpret λ {\displaystyle \lambda } graphically as a Young diagram, namely a left-justified array of square cells with m {\displaystyle m} rows and λ i {\displaystyle \lambda _{i}} cells in the i {\displaystyle i} th row for each 1 ≤ i ≤ m {\displaystyle 1\leq i\leq m} . A standard Young tableau of shape λ {\displaystyle \lambda } is a Young diagram of shape λ {\displaystyle \lambda } in which each of the n {\displaystyle n} cells contains a distinct integer between 1 and n {\displaystyle n} (i.e., no repetition), such that each row and each column form increasing sequences. For each cell of the Young diagram in coordinates ( i , j ) {\displaystyle (i,j)} (that is, the cell in the i {\displaystyle i} th row and j {\displaystyle j} th column), the hook H λ ( i , j ) {\displaystyle H_{\lambda }(i,j)} is the set of cells ( a , b ) {\displaystyle (a,b)} such that a = i {\displaystyle a=i} and b ≥ j {\displaystyle b\geq j} or a ≥ i {\displaystyle a\geq i} and b = j {\displaystyle b=j} . The hook-length h λ ( i , j ) {\displaystyle h_{\lambda }(i,j)} is the number of cells in the hook H λ ( i , j ) {\displaystyle H_{\lambda }(i,j)} . Then the hook-length formula expresses the number of standard Young tableaux of shape λ {\displaystyle \lambda } , sometimes denoted by d λ {\displaystyle d_{\lambda }} , as d λ = n ! ∏ h λ ( i , j ) , {\displaystyle d_{\lambda }={\frac {n!}{\prod h_{\lambda }(i,j)}},} where the product is over all cells ( i , j ) {\displaystyle (i,j)} of λ {\displaystyle \lambda } . The figure on the right shows hook-lengths for all cells in the Young diagram λ of the partition 9 = 4 + 3 + 1 + 1. Then the number of standard Young tableaux d λ {\displaystyle d_{\lambda }} for this Young diagram can be computed as d λ = 9 ! 7 ⋅ 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅ 2 ⋅ 1 ⋅ 1 ⋅ 1 = 216. {\displaystyle d_{\lambda }={\frac {9!}{7\cdot 5\cdot 4\cdot 3\cdot 2\cdot 2\cdot 1\cdot 1\cdot 1}}=216.} There are other formulas for d λ {\displaystyle d_{\lambda }} , but the hook-length formula is particularly simple and elegant. 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 formula expressing d λ {\displaystyle d_{\lambda }} in terms of a determinant. 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. Despite the simplicity of the hook-length formula, the Frame–Robinson–Thrall proof is uninsightful and does not provide an intuitive argument as to why hooks appear in the formula. The search for a short, intuitive explanation befitting such a simple result gave rise to many alternate proofs for the hook-length formula. A. P. Hillman and R. M. 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. C. Greene, A. Nijenhuis, and H. S. Wilf found a probabilistic proof using the hook walk in which the hook lengths appear naturally in 1979. J. B. Remmel adapted the original Frame–Robinson–Thrall proof into the first bijective proof for the hook-length formula in 1982. A direct bijective proof was first discovered by D. S. Franzblau and D. Zeilberger in 1982. D. Zeilberger also converted the Greene–Nijenhuis–Wilf hook walk proof into a bijective proof in 1984. 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. Meanwhile, the hook-length formula has been generalized in several ways. R. M. Thrall found the analogue to the hook-length formula for shifted Young Tableaux in 1952. B. E. Sagan gave a shifted hook walk proof for the hook-length formula for shifted Young tableaux in 1980. B. E. Sagan and Y. N. Yeh proved the hook-length formula for binary trees using the hook walk in 1989. The hook-length formula can be understood intuitively using the following heuristic, but incorrect, argument suggested by D. E. Knuth. Given that each element of a tableau is the smallest in its hook and filling the tableau shape at random, the probability that cell ( i , j ) {\displaystyle (i,j)} will contain the minimum element of the corresponding hook is the reciprocal of the hook length. Multiplying these probabilities over all i {\displaystyle i} and j {\displaystyle j} gives the formula. This argument is fallacious since the events are not independent. Knuth's argument is however correct for the enumeration of labellings on trees satisfying monotonicity properties analogous to those of a Young tableau. In this case, the 'hook' events in question are in fact independent events. これは1979年に、 C. Greene, A. Nijenhuis と H. S. Wilf によって発見された、確率論的証明法である。証明の概略は、次のとおりである。 e λ = n ! ∏ ( i , j ) ∈ Y ( λ ) h λ ( i , j ) . {\displaystyle e_{\lambda }={\frac {n!}{\prod _{(i,j)\in Y(\lambda )}h_{\lambda }(i,j)}}.} を定義し、 d λ = e λ {\displaystyle d_{\lambda }=e_{\lambda }} を証明する。 d λ {\displaystyle d_{\lambda }} は以下で与えられる。 d λ = ∑ μ ↑ λ d μ , {\displaystyle d_{\lambda }=\sum _{\mu \uparrow \lambda }d_{\mu },} ここで、 μ ↑ λ {\displaystyle \mu \uparrow \lambda } は、 μ {\displaystyle \mu } がヤング図形λから一つのコーナーセルを削除することで得られるヤングタブローであることを表している。 そのようなμの全体にわたって和をとる。ここで、慣習として ϕ {\displaystyle \phi } を空のダイアグラムとして、 d ϕ = 1 {\displaystyle d_{\phi }=1} を用いる。 上の式に対する説明は、「ヤングタブローの最大項はそのコーナーセルで生じるものである」となる。 そのセルを削除することで、μの形のヤングタブローを得る。 μの形のヤングタブローの数が d μ {\displaystyle d_{\mu }} であり、それらμに関して和をとることでその式を得る。 ここで、 e ϕ = 1 {\displaystyle e_{\phi }=1} であることにも注意されたい。それゆえ、次を示せば十分で、 e λ = ∑ μ ↑ λ e μ , {\displaystyle e_{\lambda }=\sum _{\mu \uparrow \lambda }e_{\mu },} その結果、 d λ = e λ {\displaystyle d_{\lambda }=e_{\lambda }} は帰納的に証明される。 上の式の和は、次のように式を書き換えることによって、確率の和と捉えることができる。 ∑ μ ↑ λ e μ e λ = 1. {\displaystyle \sum _{\mu \uparrow \lambda }{\frac {e_{\mu }}{e_{\lambda }}}=1.} われわれはこのようにして、 e μ e λ {\displaystyle {\frac {e_{\mu }}{e_{\lambda }}}} が、ヤング図形μの集合上の確率測度を定めている。（ここで μ ↑ λ {\displaystyle \mu \uparrow \lambda } ） これはフックウォークと呼ばれるランダムウォークを定義を用いた構成法によるものである。 フックウォークは、ヤング図形λの上で、ひとつのコーナーセルを選択する。 フックウォークは次のルールによって定義される。 (1) | λ | {\displaystyle |\lambda |} 個のセルのなかから一様ランダムにひとつのセルを選び、そこからランダムウォークを始める。 (2) 現在の ( i , j ) {\displaystyle (i,j)} セルの次のセルは、一様ランダムにフック H λ ( i , j ) ∖ { ( i , j ) } {\displaystyle H_{\lambda }(i,j)\setminus \{(i,j)\}} から選ぶ。 (3) 一つのコーナーに到達するまでこれを続け、そのコーナーセルを c {\displaystyle {\textbf {c}}} とする。 命題: λに属するすべてのコーナーセル ( a , b ) {\displaystyle (a,b)} に対して、次が成り立つ。 P ( c = ( a , b ) ) = e μ e λ , {\displaystyle \mathbb {P} \left({\textbf {c}}=(a,b)\right)={\frac {e_{\mu }}{e_{\lambda }}},} ここで、 μ = λ ∖ { ( a , b ) } {\displaystyle \mu =\lambda \setminus \{(a,b)\}} . この命題を得れば、すべての c = ( a , b ) {\displaystyle {\textbf {c}}=(a,b)} に関して和をとることによって、 ∑ μ ↑ λ e μ e λ = 1 {\displaystyle \sum _{\mu \uparrow \lambda }{\frac {e_{\mu }}{e_{\lambda }}}=1} を得る。 The hook-length formula is of great importance in the representation theory of the symmetric group S n {\displaystyle S_{n}} , where the number d λ {\displaystyle d_{\lambda }} is known to be equal to the dimension of the complex irreducible representation V λ {\displaystyle V_{\lambda }} associated to λ {\displaystyle \lambda } , and is frequently denoted by dim ⁡ V λ {\displaystyle \dim V_{\lambda }} , dim ⁡ λ {\displaystyle \dim \lambda } or f λ {\displaystyle f^{\lambda }} . The complex irreducible representations V λ {\displaystyle V_{\lambda }} of the symmetric group are indexed by partitions λ {\displaystyle \lambda } of n {\displaystyle n} (for an explicit construction see Specht module) . Their characters are related to the theory of symmetric functions via the Hall inner product in the following formula χ λ ( w ) = ⟨ s λ , p τ ( w ) ⟩ {\displaystyle \chi ^{\lambda }(w)=\langle s_{\lambda },p_{\tau (w)}\rangle } where s λ {\displaystyle s_{\lambda }} is the Schur function associated to λ {\displaystyle \lambda } and p τ ( w ) {\displaystyle p_{\tau (w)}} is the power-sum symmetric function of the partition τ ( w ) {\displaystyle \tau (w)} associated to the cycle decomposition of w {\displaystyle w} . For example, if w = ( 154 ) ( 238 ) ( 6 ) ( 79 ) {\displaystyle w=(154)(238)(6)(79)} then τ ( w ) = ( 3 , 3 , 2 , 1 ) {\displaystyle \tau (w)=(3,3,2,1)} . Since the identity permutation e {\displaystyle e} has the form e = ( 1 ) ( 2 ) ⋯ ( n ) {\displaystyle e=(1)(2)\cdots (n)} in cycle notation, τ ( e ) = 1 + 1 + ⋯ + 1 = 1 ( n ) {\displaystyle \tau (e)=1+1+\cdots +1=1^{(n)}} . Then the formula says dim ⁡ V λ = χ λ ( e ) = ⟨ s λ , p 1 ( n ) ⟩ {\displaystyle \dim V_{\lambda }=\chi ^{\lambda }(e)=\langle s_{\lambda },p_{1^{(n)}}\rangle } Considering the expansion of Schur functions in terms of monomial symmetric functions using the Kostka numbers s λ = ∑ μ K λ μ m μ , {\displaystyle s_{\lambda }=\sum _{\mu }K_{\lambda \mu }m_{\mu },} the inner product with p 1 ( n ) = h 1 ( n ) {\displaystyle p_{1^{(n)}}=h_{1^{(n)}}} is K λ 1 ( n ) {\displaystyle K_{\lambda 1^{(n)}}} , because ⟨ m μ , h ν ⟩ = δ μ ν {\displaystyle \langle m_{\mu },h_{\nu }\rangle =\delta _{\mu \nu }} . Note that K λ 1 ( n ) {\displaystyle K_{\lambda 1^{(n)}}} is equal to d λ {\displaystyle d_{\lambda }} . Hence dim ⁡ V λ = d λ . {\displaystyle \dim V_{\lambda }=d_{\lambda }.} An immediate consequence of this is ∑ λ ⊢ n ( f λ ) 2 = n ! {\displaystyle \sum _{\lambda \vdash n}\left(f^{\lambda }\right)^{2}=n!} The above equality is also a simple consequence of the Robinson–Schensted–Knuth correspondence. The computation also shows that: ( x 1 + x 2 + ⋯ + x k ) n = ∑ λ ⊢ n s λ f λ . {\displaystyle (x_{1}+x_{2}+\cdots +x_{k})^{n}=\sum _{\lambda \vdash n}s_{\lambda }f^{\lambda }.} Which is the expansion of p 1 ( n ) {\displaystyle p_{1^{(n)}}} in terms of Schur functions using the coefficients given by the inner product, because ⟨ s μ , s ν ⟩ = δ μ ν {\displaystyle \langle s_{\mu },s_{\nu }\rangle =\delta _{\mu \nu }} . The above equality can be proven also checking the coefficients of each monomial at both sides and using the Robinson–Schensted–Knuth correspondence or, more conceptually, looking at the decomposition of V ⊗ n {\displaystyle V^{\otimes n}} by irreducible G L ( V ) {\displaystyle GL(V)} modules, and taking characters. See Schur–Weyl duality. By the above considerations p 1 ( n ) = ∑ λ ⊢ n s λ f λ {\displaystyle p_{1^{(n)}}=\sum _{\lambda \vdash n}s_{\lambda }f^{\lambda }} So that Δ ( x ) p 1 ( n ) = ∑ λ ⊢ n Δ ( x ) s λ f λ {\displaystyle \Delta (x)p_{1^{(n)}}=\sum _{\lambda \vdash n}\Delta (x)s_{\lambda }f^{\lambda }} where Δ ( x ) = ∏ i < j ( x i − x j ) {\displaystyle \Delta (x)=\prod _{i<j}(x_{i}-x_{j})} is the Vandermonde determinant. For a given partition λ = ( λ 1 , λ 2 , ⋯ , λ k ) {\displaystyle \lambda =(\lambda _{1},\lambda _{2},\cdots ,\lambda _{k})} define l i = λ i + k − i {\displaystyle l_{i}=\lambda _{i}+k-i} for i = 1 , 2 , ⋯ , k {\displaystyle i=1,2,\cdots ,k} . For the following we need at least as many variables as rows in the partition, so from now on we work with n {\displaystyle n} variables x 1 , ⋯ , x n {\displaystyle x_{1},\cdots ,x_{n}} . Each term Δ ( x ) s λ {\displaystyle \Delta (x)s_{\lambda }} is equal to a ( λ 1 + k − 1 , λ 2 + k − 2 , … , λ k ) ( x 1 , x 2 , … , x k ) = det [ x 1 l 1 x 2 l 1 … x k l 1 x 1 l 2 x 2 l 2 … x k l 2 ⋮ ⋮ ⋱ ⋮ x 1 l k x 2 l k … x k l k ] {\displaystyle a_{(\lambda _{1}+k-1,\lambda _{2}+k-2,\dots ,\lambda _{k})}(x_{1},x_{2},\dots ,x_{k})=\det \left[{\begin{matrix}x_{1}^{l_{1}}&x_{2}^{l_{1}}&\dots &x_{k}^{l_{1}}\\x_{1}^{l_{2}}&x_{2}^{l_{2}}&\dots &x_{k}^{l_{2}}\\\vdots &\vdots &\ddots &\vdots \\x_{1}^{l_{k}}&x_{2}^{l_{k}}&\dots &x_{k}^{l_{k}}\end{matrix}}\right]} See Schur function. Since the vector ( l 1 , l 2 , ⋯ , l k ) {\displaystyle (l_{1},l_{2},\cdots ,l_{k})} is different for each partition, this means that the coefficient of x 1 l 1 ⋯ x k l k {\displaystyle x_{1}^{l_{1}}\cdots x_{k}^{l_{k}}} in Δ ( x ) p 1 ( n ) {\displaystyle \Delta (x)p_{1^{(n)}}} , denoted [ Δ ( x ) p 1 ( n ) ] l 1 , ⋯ , l k {\displaystyle \left[\Delta (x)p_{1^{(n)}}\right]_{l_{1},\cdots ,l_{k}}} , is equal to f λ {\displaystyle f^{\lambda }} . This is known as the Frobenius Character Formula, which gives one of the earliest proofs. All that remains is tracking that coefficient with a mixture of cleverness and brute force: Multiplying Δ ( x ) = ∑ w ∈ S n sgn ⁡ ( w ) x 1 w ( 1 ) − 1 x 2 w ( 2 ) − 1 ⋯ x k w ( k ) − 1 {\displaystyle \Delta (x)=\sum _{w\in S_{n}}\operatorname {sgn}(w)x_{1}^{w(1)-1}x_{2}^{w(2)-1}\cdots x_{k}^{w(k)-1}} and p 1 ( n ) = ( x 1 + x 2 + ⋯ + x k ) n = ∑ n ! d 1 ! d 2 ! ⋯ d k ! x 1 d 1 x 2 d 2 ⋯ x k d k {\displaystyle p_{1^{(n)}}=(x_{1}+x_{2}+\cdots +x_{k})^{n}=\sum {\frac {n!}{d_{1}!d_{2}!\cdots d_{k}!}}x_{1}^{d_{1}}x_{2}^{d_{2}}\cdots x_{k}^{d_{k}}} we conclude that the coefficient that we are looking for is ∑ w ∈ S n sgn ⁡ ( w ) n ! ( l 1 − w ( 1 ) + 1 ) ! ( l 2 − w ( 2 ) + 1 ) ! ⋯ ( l k − w ( k ) + 1 ) ! {\displaystyle \sum _{w\in S_{n}}\operatorname {sgn}(w){\frac {n!}{(l_{1}-w(1)+1)!(l_{2}-w(2)+1)!\cdots (l_{k}-w(k)+1)!}}} which can be written as n ! l 1 ! l 2 ! ⋯ l k ! ∑ w ∈ S n sgn ⁡ ( w ) [ ( l 1 ) ( l 1 − 1 ) ⋯ ( l 1 − w ( 1 ) + 2 ) ] [ ( l 2 ) ( l 2 − 1 ) ⋯ ( l 2 − w ( 2 ) + 2 ) ] [ ( l k ) ( l k − 1 ) ⋯ ( l k − w ( k ) + 2 ) ] {\displaystyle {\frac {n!}{l_{1}!l_{2}!\cdots l_{k}!}}\sum _{w\in S_{n}}\operatorname {sgn}(w)\left[(l_{1})(l_{1}-1)\cdots (l_{1}-w(1)+2)\right]\left[(l_{2})(l_{2}-1)\cdots (l_{2}-w(2)+2)\right]\left[(l_{k})(l_{k}-1)\cdots (l_{k}-w(k)+2)\right]} The latter sum is equal to the following determinant det [ 1 l 1 l 1 ( l 1 − 1 ) … ∏ i = 0 k − 2 ( l 1 − i ) 1 l 2 l 2 ( l 2 − 1 ) … ∏ i = 0 k − 2 ( l 2 − i ) ⋮ ⋮ ⋮ ⋱ ⋮ 1 l k l k ( l k − 1 ) … ∏ i = 0 k − 2 ( l k − i ) ] {\displaystyle \det \left[{\begin{matrix}1&l_{1}&l_{1}(l_{1}-1)&\dots &\prod _{i=0}^{k-2}(l_{1}-i)\\1&l_{2}&l_{2}(l_{2}-1)&\dots &\prod _{i=0}^{k-2}(l_{2}-i)\\\vdots &\vdots &\vdots &\ddots &\vdots \\1&l_{k}&l_{k}(l_{k}-1)&\dots &\prod _{i=0}^{k-2}(l_{k}-i)\end{matrix}}\right]} which column reduces to the Vandermonde determinant, and we obtain the formula d λ = n ! l 1 ! l 2 ! ⋯ l k ! ∏ i < j ( l i − l j ) {\displaystyle d_{\lambda }={\frac {n!}{l_{1}!l_{2}!\cdots l_{k}!}}\prod _{i<j}(l_{i}-l_{j})} Note that l i {\displaystyle l_{i}} is the hook length of the first box in each row of the Young Diagram. Transforming this expression into the form n ! ∏ h λ ( i , j ) {\displaystyle {\frac {n!}{\prod h_{\lambda }(i,j)}}} claimed by the hook-length formula is a fairly simple exercise in combinatorics: For any given i = 1 , 2 , … , k {\displaystyle i=1,2,\ldots ,k} , one has to argue that l i ! = ( ∏ j > i ( l i − l j ) ) ⋅ ∏ c h λ ( c ) {\displaystyle l_{i}!=\left(\prod _{j>i}(l_{i}-l_{j})\right)\cdot \prod _{c}h_{\lambda }(c)} , where the latter product ranges over all cells c {\displaystyle c} in the i {\displaystyle i} -row of the Young diagram of λ {\displaystyle \lambda } . The hook length formula also has important applications to the analysis of longest increasing subsequences in random permutations. If σ n {\displaystyle \sigma _{n}} denotes a uniformly random permutation of order n {\displaystyle n} , L ( σ n ) {\displaystyle L(\sigma _{n})} denotes the maximal length of an increasing subsequence of σ n {\displaystyle \sigma _{n}} , and ℓ n {\displaystyle \ell _{n}} denotes the expected (average) value of L ( σ n ) {\displaystyle L(\sigma _{n})} , Anatoly Vershik and Sergei Kerov and independently Benjamin F. Logan and Lawrence A. Shepp showed that when n {\displaystyle n} is large, ℓ n {\displaystyle \ell _{n}} is approximately equal to 2 n {\displaystyle 2{\sqrt {n}}} . This answers a question originally posed by Stanislaw Ulam. The proof is based on translating the question via the Robinson–Schensted correspondence to a problem about the limiting shape of a random Young tableau chosen according to Plancherel measure. Since the definition of Plancherel measure involves the quantity d λ {\displaystyle d_{\lambda }} , the hook length formula can then be used to perform an asymptotic analysis of the limit shape and thereby also answer the original question. The ideas of Vershik–Kerov and Logan–Shepp were later refined by Jinho Baik, Percy Deift and Kurt Johansson, who were able to achieve a much more precise analysis of the limiting behavior of the maximal increasing subsequence length, proving an important result now known as the Baik–Deift–Johansson theorem. Their analysis again makes crucial use of the fact that d λ {\displaystyle d_{\lambda }} has a number of good formulas, although instead of the hook length formula it made use of one of the determinantal expressions. The formula for the number of Young tableau of a given shape was originally derived from the Frobenius determinant formula in connection to representation theory. If the shape of a Young diagram is given by the row lengths n 1 , … , n m {\displaystyle n_{1},\dots ,n_{m}} , then the number of tableau with that shape is given by f ( n 1 , n 2 , … , n m ) = n ! Δ ( n m , n m − 1 + 1 , … , n 1 + m − 1 ) n m ! ( n m − 1 + 1 ) ! ⋯ ( n 1 + m − 1 ) ! {\displaystyle f(n_{1},n_{2},\ldots ,n_{m})={\frac {n!\,\Delta (n_{m},n_{m-1}+1,\ldots ,n_{1}+m-1)}{n_{m}!(n_{m-1}+1)!\cdots (n_{1}+m-1)!}}} Hook lengths can also be used to give a product representation to the generating function for the number of reverse plane partitions of a given shape. If λ is a partition of some integer p, a reverse plane partition of n with shape λ is obtained by filling in the boxes in the Young diagram with non-negative integers such that the entries add to n and are non-decreasing along each row and down each column. The hook lengths h 1 , … , h p {\displaystyle h_{1},\dots ,h_{p}} can be defined as with Young tableau. If πn denotes the number of reverse plane partitions of n with shape λ, then the generating function can be written as ∑ n = 0 ∞ π n x n = ∏ k = 1 p ( 1 − x h k ) − 1 {\displaystyle \sum _{n=0}^{\infty }\pi _{n}x^{n}=\prod _{k=1}^{p}(1-x^{h_{k}})^{-1}} Stanley discovered another formula for the same generating function. In general, if A {\displaystyle A} is any poset with n {\displaystyle n} elements, the generating function for reverse A {\displaystyle A} -partitions is P ( x ) ( 1 − x ) ( 1 − x 2 ) ⋯ ( 1 − x n ) {\displaystyle {\frac {P(x)}{(1-x)(1-x^{2})\cdots (1-x^{n})}}} where P ( x ) {\displaystyle P(x)} is a polynomial such that P ( 1 ) {\displaystyle P(1)} is the number of natural labelings of A {\displaystyle A} . In the case of a partition λ {\displaystyle \lambda } , we are considering the poset in its cells given by the relation ( i , j ) ≤ ( i ′ , j ′ ) ⟺ i ≤ i ′ and j ≤ j ′ {\displaystyle (i,j)\leq (i',j')\iff i\leq i'\qquad {\textrm {and}}\qquad j\leq j'} . So a natural labeling is simply a standard Young tableau, i.e. P ( 1 ) = f λ {\displaystyle P(1)=f^{\lambda }} Combining the two formulas for the generating functions we have P ( x ) ( 1 − x ) ( 1 − x 2 ) ⋯ ( 1 − x n ) = ∏ ( i , j ) ∈ λ ( 1 − x h ( i , j ) ) − 1 {\displaystyle {\frac {P(x)}{(1-x)(1-x^{2})\cdots (1-x^{n})}}=\prod _{(i,j)\in \lambda }(1-x^{h_{(i,j)}})^{-1}} Both sides converge inside the disk of radius one and the following expression makes sense for | x | < 1 {\displaystyle |x|<1} P ( x ) = ∏ k = 1 n ( 1 − x k ) ∏ ( i , j ) ∈ λ ( 1 − x h ( i , j ) ) . {\displaystyle P(x)={\frac {\prod _{k=1}^{n}(1-x^{k})}{\prod _{(i,j)\in \lambda }(1-x^{h_{(i,j)}})}}.} It would be violent to plug in 1, but the right hand side is a continuous function inside the unit disk and a polynomial is continuous everywhere so at least we can say P ( 1 ) = lim x → 1 ∏ k = 1 n ( 1 − x k ) ∏ ( i , j ) ∈ λ ( 1 − x h ( i , j ) ) . {\displaystyle P(1)=\lim _{x\to 1}{\frac {\prod _{k=1}^{n}(1-x^{k})}{\prod _{(i,j)\in \lambda }(1-x^{h_{(i,j)}})}}.} Finally, applying L'Hopital's rule n {\displaystyle n} times yields the hook length formula P ( 1 ) = n ! ∏ ( i , j ) ∈ λ h ( i , j ) . {\displaystyle P(1)={\frac {n!}{\prod _{(i,j)\in \lambda }h_{(i,j)}}}.} Specializing the schur functions to the variables 1 , t , t 2 , t 3 , ⋯ {\displaystyle 1,t,t^{2},t^{3},\cdots } there is the formula s λ ( 1 , t , t 2 , ⋯ ) = t n ( λ ) ∏ ( i , j ) ∈ Y ( λ ) ( 1 − t h λ ( i , j ) ) {\displaystyle s_{\lambda }(1,t,t^{2},\cdots )={\frac {t^{n\left(\lambda \right)}}{\prod _{(i,j)\in Y(\lambda )}(1-t^{h_{\lambda }(i,j)})}}} The number n ( λ ) {\displaystyle n(\lambda )} is defined as n ( λ ) = ∑ i ( i − 1 ) λ i = ∑ i ( λ i ′ 2 ) {\displaystyle n(\lambda )=\sum _{i}(i-1)\lambda _{i}=\sum _{i}{\binom {\lambda _{i}'}{2}}} where λ ′ {\displaystyle \lambda '} is the conjugate partition There is a generalization of this formula for skew shapes, s λ / μ ( 1 , t , t 2 , ⋯ ) = ∑ S ∈ E ( λ / μ ) ∏ ( i , j ) ∈ λ ∖ S t λ j ′ − i 1 − t h ( i , j ) {\displaystyle s_{\lambda /\mu }(1,t,t^{2},\cdots )=\sum _{S\in E(\lambda /\mu )}\prod _{(i,j)\in \lambda \setminus S}{\frac {t^{\lambda _{j}'-i}}{1-t^{h(i,j)}}}} where the sum is taken over excited diagrams of shape λ {\displaystyle \lambda } and boxes distributed according to μ {\displaystyle \mu } . The Catalan numbers are ubiquitous in enumerative combinatorics. Not surprisingly, they are also part of this story: C n = f ( n , n ) {\displaystyle C_{n}=f^{(n,n)}} Lets briefly mention why. When doing a Dyck path we may go up (U) or down (D). So for any Dyck path of length n {\displaystyle n} consider the tableaux of shape ( n , n ) {\displaystyle (n,n)} such that the first row is given by the numbers i {\displaystyle i} such that the i {\displaystyle i} -th step was up and in the second row given by the positions in which it goes down. For example, UUDDUD correspond to the tableaux with rows 125 and 346. The hook formula gives another way of getting a closed formula for the Catalan numbers C n = ( 2 n ) ! ( n + 1 ) ( n ) ⋯ ( 3 ) ( 2 ) ( n ) ( n − 1 ) ⋯ ( 2 ) ( 1 ) = ( 2 n ) ! ( n + 1 ) ! n ! = 1 n + 1 ( 2 n n ) {\displaystyle C_{n}={\frac {(2n)!}{(n+1)(n)\cdots (3)(2)(n)(n-1)\cdots (2)(1)}}={\frac {(2n)!}{(n+1)!n!}}={\frac {1}{n+1}}{\binom {2n}{n}}} [脚注の使い方] ^ Frame, J. S., Robinson, G. de B. and Thrall, R. M. (1954). The hook graphs of the symmetric group. Can. J. Math. 6, 316–325. ^ G. Frobenius. Uber die charaktere der symmetrischer gruppe, Preuss. &ad. Wk. sitz. (1900), 516–534. ^ A. Young. Quantitative substitutional analysis II, Proc. London Math. Sot., Ser. 1, 35 (1902), 361–397. ^ P. A. MacMahon. “Combinatory Analysis,” Cambridge Univ. Press, London/New York, 1916; reprinted by Chelsea, New York, 1960. ^ Knuth, Donald (1973). The Art of Computer Programming, Volume 3: Sorting and Searching, 3rd Edition, Addison–Wesley, p. 63 ^ A. P. Hillman and R. M. Grassl. Reverse plane partitions and tableau hook numbers, J. Comb. Theory, Ser. A 21 (1976), 216–221. ^ a b Greene, C., Nijenhuis, A. and Wilf, H. S. (1979). A probabilistic proof of a formula for the number of Young tableaux of a given shape. Adv. in Math. 31, 104–109. ^ J. B. Remmel. Bijective proofs of formulae for the number of standard Young tableaux, Linear and Multilinear Algebra 11 (1982), 45–100. ^ Franzblau, D. S. and Zeilberger, D. (1982). A bijective proof of the hook-length formula. J. Algorithms 3, 317–343. ^ D. Zeilberger. A short hook-lengths bijection inspired by the Greene–Nijenhuis–Wilf proof, Discrete Math. 51 (1984), 101–108. ^ Pak, I. M. and Stoyanovskii, A. V. (1992). A bijective proof of the hook-length formula. Funct. Anal. Appl. 24. ^ Novelli, J.-C., Pak, I. M. and Stoyanovskii, A. V. (1997). A direct bijective proof of the hook-length formula. Discrete Mathematics and Theoretical Computer Science 1, 1997, 53–67. ^ R. M. Thrall. A combinatorial problem, Michigan Math. J. 1 (1952), 81–88. ^ Sagan, B. On selecting a random shifted Young tableau. J. Algorithms 1, 3 (1980), 213–234. ^ Sagan, B. E., and Yeh, Y. N. Probabilistic algorithms for trees. Fibonacci Quart. 27, 3 (1989), 201–208. ^ Knuth, Donald (1973), The Art of Computer Programming, Volume 3: Sorting and Searching, 3rd Edition, Addison–Wesley, p. 63, ISBN 0-201-03803-X . ^ W. Fulton, J. Harris. Representation Theory: A First Course Springer-Verlag , New York, 1991 ^ Vershik, A. M.; Kerov, C. V. (1977), "Asymptotics of the Plancheral measure of the symmetric group and a limiting form for Young tableaux", Dokl. Akad. Nauk SSSR 233: 1024–1027 ^ B. F. Logan and L. A. Shepp, A variational problem for random Young tableaux, Advances in Math. 26 (1977), no. 2, 206–222. ^ Knuth, Donald (1973), The Art of Computer Programming, 3 (1 ed.), Addison–Wesley, pp. 61–62  ^ Stanley, Richard P. (1971), “Theory and applications of plane partitions, 2”, Studies in Applied Mathematics 50: 259–279  ^ R.P. Stanley, "Ordered Structures and Partitions" PhD Thesis, Harvard University, 1971 ^ Morales, A. H., Pak, I., and Panova, G. Hook formulas for skew shapes, arXiv:1512.08348. ヤング図形 シューア多項式 A published book on longest increasing subsequences by Dan Romik (PDF copy available for download). Contains discussions of the hook length formula and several of its variants, with applications to the mathematics of longest increasing subsequences.