Singh and Barman's hook length bias conjecture for t-regular partitions
Let denote the number of hooks of length across all -regular partitions of . Singh and Barman's conjecture. For every integer and every ,
The conjecture compares the total number of -hooks in -regular and -regular partitions. The paper proves this inequality, so the conjecture is resolved.
References
- Hongshu Lin and Wenston J. T. Zang, “Proof of Singh and Barman's conjecture on hook length biases”, arXiv:2510.19185 (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.