Approximate homomorphism testing conjecture

From papers

Let f:F2nF2mf:\mathbb{F}_2^n \to \mathbb{F}_2^m be a function, and let ϵ\epsilon measure the probability that it satisfies the additive homomorphism equation on uniformly sampled x,yF2nx,y \in \mathbb{F}_2^n. Approximate homomorphism testing conjecture. If

Prx,y[f(x+y)=f(x)+f(y)]ϵ,\Pr_{x,y}[f(x+y)=f(x)+f(y)] \ge \epsilon,

then there is a linear map :F2nF2m\ell:\mathbb{F}_2^n \to \mathbb{F}_2^m such that

Prx[f(x)=(x)]ϵO(1).\Pr_x[f(x)=\ell(x)] \ge \epsilon^{O(1)}.

This is an equivalent formulation of the Polynomial Freiman–Ruzsa conjecture in the source. The paper presents it as an open polynomial quantitative strengthening of approximate homomorphism testing.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Shachar Lovett, “Equivalence of polynomial conjectures in additive combinatorics”, arXiv:1001.3356 (2010).

Solutions 0

No solutions have been posted yet.