ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,…,n}[n]=\{1,\ldots,n\}, let U(A)\mathcal{U}(A) denote the uniform distribution on a finite set AA, and let (f,g)(f,g) be probabilistic strategies satisfying the correctness condition for correlated sampling. For positive integers n,a,b,ℓn,a,b,\ell with ℓ≥2\ell\geq 2 and n≥a+b−ℓn\geq a+b-\ell, consider sets A,B⊆[n]A,B\subseteq[n] with ∣A∣=a|A|=a, ∣B∣=b|B|=b, and ∣A∩B∣=ℓ|A\cap B|=\ell. Rivest's conjecture. For every such n,a,b,ℓn,a,b,\ell and every pair (f,g)(f,g), there exist sets A,B⊆[n]A,B\subseteq[n] with these sizes such that

Pr⁡[f(A)≠g(B)]≥1−ℓa+b−ℓ=1−∣A∩B∣∣A∪B∣.\Pr[f(A)\ne g(B)]\geq 1-\frac{\ell}{a+b-\ell}=1-\frac{|A\cap B|}{|A\cup B|}.

This conjecture asserts that Broder's MinHash correlated-sampling strategy is optimal except in the case of intersection size one covered by Rivest's protocol. The paper's main result proves the asserted lower bound for constant-fraction intersections, while the fully general statement remains open.

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.