Singh–Barman's hook bias conjecture for 2-regular partitions
Statement
Let denote the number of hooks of length in all -regular partitions of . Singh–Barman's conjecture. For every integer , for all and .
This conjecture concerns the relative frequency of consecutive hook lengths in 2-regular partitions. It is false for odd : the paper gives a counterexample at , , and proves that every odd has infinitely many counterexamples. It is proved for and , while the even cases beyond these remain open.
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.