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 every integer k3k 3, b2,k(n)b2,k+1(n)b_{2,k}(n) b_{2,k+1}(n) for all n0n 0 and nek+1ne k+1.

This conjecture concerns the relative frequency of consecutive hook lengths in 2-regular partitions. It is false for odd kk: the paper gives a counterexample at k=3k=3, n=82n=82, and proves that every odd ke3ke 3 has infinitely many counterexamples. It is proved for k=4k=4 and k=6k=6, 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 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.