ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a probability distribution p{\bf p} with finite support, let CnC_n be the maximum of D(p)D({\bf p}) over distributions whose support has size nn, and set

C∞:=sup⁡nCn.C_\infty:=\sup_n C_n.

Let

C:=max⁡p∈PZ+D(p).C:=\max_{{\bf p}\in\mathbb{P}_{\mathbb{Z}_+}}D({\bf p}).

Support-maximization conjecture. The global maximum exists, equals the supremum of the finite-support maxima, and is strictly less than 11:

C∞=C<1.C_\infty=C<1.

The paper presents this as a conjecture about the largest possible discrepancy and does not prove either the equality or the strict bound.

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.