Equality of finite- and countable-support discrepancy maxima
Statement
For a probability distribution with finite support, let be the maximum of over distributions whose support has size , and set
Let
Support-maximization conjecture. The global maximum exists, equals the supremum of the finite-support maxima, and is strictly less than :
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.