Singh–Barman's hook bias conjecture for 3-regular partitions
Statement
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.
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.