Polynomiality of some hook-length statistics

DOI10.1007/s11139-011-9332-zzbMath1244.05230arXiv0811.3463OpenAlexW2067425321MaRDI QIDQ427273

Greta Panova

Publication date: 13 June 2012

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.3463

zbMATH Keywords

partitionPlancherel measurelongest increasing subsequencestandard Young tableauxhook length

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of representation theory (05E10)

Related Items (10)

New hook-content formulas for strict partitions ⋮ Multiplication theorems for self-conjugate partitions ⋮ Difference operators for partitions and some applications ⋮ Polynomiality of shifted Plancherel averages and content evaluations ⋮ Modular Nekrasov-Okounkov formulas ⋮ Difference operators for partitions under the Littlewood decomposition ⋮ Asymptotics of some Plancherel averages via polynomiality results ⋮ Polynomiality of certain average weights for oscillating tableaux ⋮ Unnamed Item ⋮ Polynomiality of Plancherel averages of hook-content summations for strict, doubled distinct and self-conjugate partitions

Cites Work

• Some combinatorial properties of hook lengths, contents, and parts of partitions
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• Some Conjectures and Open Problems on Partition Hook Lengths
• The Hook Graphs of the Symmetric Group

This page was built for publication: Polynomiality of some hook-length statistics