The sparsity conjecture for equal partition counts
Statement
Let denote the partition-counting numbers considered in the paper, with and indexing the relevant family.
Sparsity conjecture. Fix integers with . If for some integers , then .
The conjecture asserts that any repetition between entries with distinct indices must involve the exceptional value . It is motivated by the listed computational repetitions, all of which have , while the general problem of determining integral points in the corresponding curves is difficult. No general proof or disproof is supplied.
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.