Singh–Barman's hook bias conjecture for 3-regular partitions
Let denote the number of hooks of length in all -regular partitions of . Singh–Barman's conjecture. For all , .
This conjecture concerns the bias between hooks of lengths two and one in 3-regular partitions. The paper states that its first main result confirms the conjecture, so it is solved.
References
Status
- Solved: Wenxia Qu and Wenston J.T. Zang. On the hook length biases of the 2- and 3-regular partitions (Journal of Number Theory, 2026) https://arxiv.org/abs/2501.13753
Source: Wenxia Qu and Wenston J. T. Zang, “On the hook length biases of the 2- and 3-regular partitions”, arXiv:2501.13753 (2025).
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.