On the maximum number of k-hooks of partitions of n
From MaRDI portal
Abstract: Let denote the number of -hooks in a partition and let be the maximum value of among partitions of . Amdeberhan posed a conjecture on the generating function of . We give a proof of this conjecture. In general, we obtain a formula that can be used to determine . This leads to a generating function formula for . We introduce the notion of nearly -triangular partitions. We show that for any , there is a nearly -triangular partition which can be transformed into a partition of that attains the maximum number of -hooks. The operations for the transformation enable us to compute the number .
Recommendations
Cites work
- scientific article; zbMATH DE number 194092 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- Partition bijections, a survey
- Ramanujan's Lost Notebook
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- Two symmetry problems in potential theory
Cited in
(4)
This page was built for publication: On the maximum number of \(k\)-hooks of partitions of \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396759)