Amdeberhan's generating-function conjecture for the maximum number of 1-hooks
Let denote the set of partitions of , and let be the number of -hooks in a partition , equivalently the number of distinct parts. Define
Write
Amdeberhan's conjecture. The generating function for the sequence is
References
Status
- Solved: Anna R. B. Fan, Harold R. L. Yang, and Rebecca T. Yu. On the Maximum Number of k-Hooks of Partitions of n (The Electronic Journal of Combinatorics, 2013) https://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p49
Source: Anna R. B. Fan, Harold R. L. Yang and Rebecca T. Yu, “On the Maximum Number of k-Hooks of Partitions of n”, arXiv:1212.3505 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.