ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D(p)D({\bf p}) be the discrepancy for a probability distribution p{\bf p} on n+1n+1 colors. For n>0n>0 and x∈[1/(n+1),1)x\in[1/(n+1),1), define

p(n,x)=(x,1−xn,…,1−xn),{\bf p}(n,x)=\left(x,\frac{1-x}{n},\ldots,\frac{1-x}{n}\right),

and let xnx_n be a maximizer of D(p(n,x))D({\bf p}(n,x)) over the one-parameter family. Unique finite-color extremal conjecture. For every nonnegative integer nn, the maximum of D(p)D({\bf p}) among all probability distributions on n+1n+1 colors is achieved uniquely by p(n,xn){\bf p}(n,x_n). This is stated as a stronger version of the preceding finite-color conjecture. The paper gives verification for n=0,1,2n=0,1,2 but no proof for all 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.