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.05008OpenAlexW2128430147MaRDI QIDQ1254319
Albert Nijenhuis, Curtis Greene, Herbert S. Wilf
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 TheoremHook FormulaProbabilistic ProofRepresentation Theory of the Symmetric GroupsStandard Young Tableaux
Exact enumeration problems, generating functions (05A15) Representations of finite symmetric groups (20C30)
Related Items
Markov processes on partitions, On growing a random Young tableau, Transition probabilities for continual Young diagrams and the Markov moment problem, Explicit formulas for hook walks on continual Young diagrams, A probabilistic method for the number of standard immaculate tableaux, Straightening Bases for Tensor Products, The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram, Hook formulas for skew shapes. IV: Increasing tableaux and factorial Grothendieck polynomials, Random sorting networks, On a likely shape of the random Ferrers diagram, Limit shapes for random square Young tableaux, A combinatorial proof of the Giambelli identity for Schur functions, Standard Young tableaux of height 4 and 5, Hook formulas for skew shapes. I: \(q\)-analogues and bijections, The expectation of the Vandermonde product squared for uniform random variables, Difference operators for partitions under the Littlewood decomposition, Partial difference equations in \(m_1\geq m_2\geq \dots \geq m_n\geq 0\) and their applications to combinatorics, Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications, Quantum cohomology of Hilb\(_n(\mathbb C^2)\) and the weighted hook walk on Young diagrams, Plactic key agreement (insecure?), The weighted hook-length formula. II: Complementary formulas, Enumeration of partitions with hooklengths, Results and conjectures on the number of standard strong marked tableaux, Hook, line and sinker: a bijective proof of the skew shifted hook-length formula, Polynomiality of certain average weights for oscillating tableaux, Unnamed Item, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications, The weighted hook length formula, Another probabilistic method in the theory of Young tableaux, On an identity of Glass and Ng concerning the hook length formula, A note on some new hook-content identities, A bijective proof of the hook-length formula for skew shapes, A bijective proof of the hook-length formula for standard immaculate tableaux, Bottom-up: a new algorithm to generate random linear extensions of a poset, A bijective proof of the hook-length formula for skew shapes, On random shifted standard Young tableaux and 132-avoiding sorting networks, On the Okounkov-Olshanski formula for standard tableaux of skew shapes, A random \(q,t\)-hook walk and a sum of Pieri coefficients, On an inclusion-exclusion formula based on the reflection principle, A probabilistic approach toward conjugacy classes in the finite general linear and unitary groups, Hook formulas for skew shapes. III: Multivariate and product formulas, Lumpings of algebraic Markov chains arise from subquotients, Approximate counting of standard set-valued tableaux, Hook length products and Cayley operators of classical invariant theory, Bijective proofs of formulae for the number of standard Yound tableaux, A \(q\)-analog of the hook walk algorithm for random Young tableaux, A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof, Weighted inversion numbers, restricted growth functions, and standard Young tableaux, On the distribution of the number of Young tableaux for a uniformly random diagram, Young tableaux and longest monotone subsequences: An inequality and a conjecture, A \(q\)-analog of the hook walk algorithm and random Young tableaux
Cites Work
