ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let bt,i(n)b_{t,i}(n) denote the number of hooks of length ii in all tt-regular partitions of nn. Singh–Barman's conjecture. For all n≥28n\ge 28, b3,2(n)≥b3,1(n)b_{3,2}(n)\ge b_{3,1}(n).

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.