Odd-versus-distinct partition hook bias conjecture
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.