A universal upper bound for pair discrepancy
Statement
Let denote the total variation discrepancy between the color distributions of a pair selected by the two matching procedures, and define
where the supremum ranges over all probability distributions on a finite or countable set of colors. Universal discrepancy bound. The constant satisfies
Since total variation distance is at most , this conjecture asks for a nontrivial universal bound on the discrepancy; the paper does not establish it.
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.