ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer and let r⋆r_\star be the maximum value of the rr-loading over triples of partitions of nn. For a partition, notation such as (k4)(k^4) means four parts equal to kk, and (22k)(2^{2k}) means 2k2k parts equal to 22.

Maximizer conjecture for r⋆r_\star. When n=4kn=4k with k≥2k\ge 2, the values r⋆r_\star are attained by

t=((k4),(22k),(22k)).\mathbf t=((k^4),(2^{2k}),(2^{2k})).

The conjecture is inferred from the cases n=8,12,16,20n=8,12,16,20 displayed in the paper; no proof or resolution 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.