On the maximum number of \(k\)-hooks of partitions of \(n\)

zbMath1295.05031arXiv1212.3505MaRDI QIDQ396759

Harold R. L. Yang, Anna R. B. Fan, Rebecca T. Yu

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

partitionhook lengthnearly \(k\)-triangular partition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partition bijections, a survey
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• Ramanujan's Lost Notebook

This page was built for publication: On the maximum number of \(k\)-hooks of partitions of \(n\)