ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D(p)D({\bf p}) denote the total variation discrepancy between the color distributions of a pair selected by the two matching procedures, and define

ℓ0:=sup⁡pD(p),\ell_0:=\sup_{\bf p}D({\bf p}),

where the supremum ranges over all probability distributions p{\bf p} on a finite or countable set of colors. Universal discrepancy bound. The constant satisfies

ℓ0<1.\ell_0<1.

Since total variation distance is at most 11, 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 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.