Odd-versus-distinct partition hook bias conjecture
Let be the set of partitions of into odd parts and let be the set of partitions of into distinct parts. For , let and denote the total numbers of hooks of length in the partitions in and , respectively.
Odd-versus-distinct hook bias conjecture. For every integer , there exists an integer such that for all , . The conjectured values are
Moreover, for every integer ,
This reverses the bias at hook length , where the corresponding inequality goes in the opposite direction. The assertion is proved for and in the cited paper, while the general case remains conjectural.
References
- Cristina Ballantine, Hannah Burson, William Craig, Amanda Folsom and Boya Wen, “Hook length biases and general linear partition inequalities”, arXiv:2303.16512 (2023).
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.