ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For each nn, let λgmax⁡(n)⊨n\lambda^{(n)}_{g\max}\models n be a partition of nn maximizing its projective degree gλg^\lambda. For a partition μ⊨n\mu\models n, define its set of 11-successors by

N(μ,1)={λ⊨n+1∣∣λi−μi∣≤1 for 1≤i≤s},N(\mu,1)=\{\lambda\models n+1\mid |\lambda_i-\mu_i|\leq 1\text{ for }1\leq i\leq s\},

where λ=(λ1,…,λs)\lambda=(\lambda_1,\ldots,\lambda_s). Successor conjecture. For all nn, the maximal projective-degree partition at size n+1n+1 satisfies

λgmax⁡(n+1)∈N(λgmax⁡(n),1).\lambda^{(n+1)}_{g\max}\in N(\lambda^{(n)}_{g\max},1).

The claim extrapolates an observation verified computationally for 1≤n<1001\leq n<100; when a maximum is not unique, the source specifies that every maximizer at size n+1n+1 should be a 11-successor of every maximizer at size nn.

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.