In this paper, we study two questions related to the problem of testing whether a function is close to a homomorphism. For two finite groups G,H (not necessarily Abelian), an arbitrary map f : G,H, and a parameter 0 < e < 1, say that f is e-close to a homomorphism if there is some homomorphism g such that g and f differ on at most e | G | elements of G, and say that f is e-far otherwise. For a given f and e, a homomorphism tester should distinguish whether f is a homomorphism, or if f is e-far from a homomorphism. When G is Abelian, it was known that the test which picks O(1/e) random pairs x,y and tests that f(x) + f(y) = f(x + y) gives a homomorphism tester. Our first result shows that such a test works for all groups G.
Next, we consider functions that are close to their self-convolutions. Let A = lag | g e Gr be a distribution on G. The self-convolution of A, A′ = la g′ | g e Gr, is defined by $$a^{\prime}_x = \sum_{y,z \in G; yz=x}a_y a_z.$$ It is known that A= A′ exactly when A is the uniform distribution over a subgroup of G. We show that there is a sense in which this characterization is robust—that is, if A is close in statistical distance to A′, then A must be close to uniform over some subgroup of G.
Finally, we show a relationship between the question of testing whether a function is close to a homomorphism via the above test and the question of characterizing functions that are close to their self-convolutions. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008
A preliminary version of this paper appeared in RANDOM 2004 [3].
[1]
Luca Trevisan,et al.
A PCP characterization of NP with optimal amortized query complexity
,
2000,
STOC '00.
[2]
P. Diaconis.
Group representations in probability and statistics
,
1988
.
[3]
Oded Goldreich,et al.
Locally testable codes and PCPs of almost-linear length
,
2002,
The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[4]
Carsten Lund,et al.
Proof verification and the hardness of approximation problems
,
1998,
JACM.
[5]
Mihir Bellare,et al.
Linearity testing in characteristic two
,
1996,
IEEE Trans. Inf. Theory.
[6]
Eli Ben-Sasson,et al.
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
,
2003,
STOC '03.
[7]
Avi Wigderson,et al.
Derandomizing homomorphism testing in general groups
,
2004,
STOC '04.
[8]
Avi Wigderson,et al.
Simple analysis of graph tests for linearity and PCP
,
2003,
Random Struct. Algorithms.
[9]
Manuel Blum,et al.
Self-testing/correcting with applications to numerical problems
,
1990,
STOC '90.