ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pdnp_d^n denote the partition-counting numbers considered in the paper, with nn and dd indexing the relevant family.

Sparsity conjecture. Fix integers d,ed,e with 2<d<e2<d<e. If pdn=pemp_d^n=p_e^m for some integers n,mn,m, then d=3d=3.

The conjecture asserts that any repetition between entries with distinct indices d<ed<e must involve the exceptional value d=3d=3. It is motivated by the listed computational repetitions, all of which have d=3d=3, 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 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.