A probabilistic proof of a formula for the number of Young tableaux of a given shape
From MaRDI portal
Publication:1254319
DOI10.1016/0001-8708(79)90023-9zbMath0398.05008MaRDI QIDQ1254319
Herbert S. Wilf, Curtis Greene, Albert Nijenhuis
Publication date: 1979
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(79)90023-9
Branching Theorem; Hook Formula; Probabilistic Proof; Representation Theory of the Symmetric Groups; Standard Young Tableaux
05A15: Exact enumeration problems, generating functions
20C30: Representations of finite symmetric groups
Related Items
Straightening Bases for Tensor Products, Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications, A bijective proof of the hook-length formula for skew shapes, Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams, Results and conjectures on the number of standard strong marked tableaux, The weighted hook length formula, On an identity of Glass and Ng concerning the hook length formula, A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof, Markov processes on partitions, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications, Weighted inversion numbers, restricted growth functions, and standard Young tableaux, On growing a random Young tableau, A combinatorial proof of the Giambelli identity for Schur functions, Standard Young tableaux of height 4 and 5, Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics, Enumeration of partitions with hooklengths, A random \(q,t\)-hook walk and a sum of Pieri coefficients, A probabilistic approach toward conjugacy classes in the finite general linear and unitary groups, A \(q\)-analog of the hook walk algorithm for random Young tableaux, A \(q\)-analog of the hook walk algorithm and random Young tableaux, Transition probabilities for continual Young diagrams and the Markov moment problem, On a likely shape of the random Ferrers diagram, Hook formulas for skew shapes. I: \(q\)-analogues and bijections, Difference operators for partitions under the Littlewood decomposition, On an inclusion-exclusion formula based on the reflection principle, On the distribution of the number of Young tableaux for a uniformly random diagram, Explicit formulas for hook walks on continual Young diagrams, Another probabilistic method in the theory of Young tableaux, Random sorting networks, The weighted hook-length formula. II: Complementary formulas, Limit shapes for random square Young tableaux, A bijective proof of the hook-length formula for standard immaculate tableaux, Young tableaux and longest monotone subsequences: An inequality and a conjecture, Hook length products and Cayley operators of classical invariant theory, Bijective proofs of formulae for the number of standard Yound tableaux
Cites Work
