English

Juntas in the $\ell^{1}$-grid and Lipschitz maps between discrete tori

Combinatorics 2015-08-18 v4

Abstract

We show that if A[k]nA \subset [k]^n, then AA is ϵ\epsilon-close to a junta depending upon at most exp(O(A/(kn1ϵ)))\exp(O(|\partial A|/(k^{n-1}\epsilon))) coordinates, where A\partial A denotes the edge-boundary of AA in the 1\ell^1-grid. This is sharp up to the value of the absolute constant in the exponent. This result can be seen as a generalisation of the Junta theorem for the discrete cube, from [E. Friedgut, Boolean functions with low average sensitivity depend on few coordinates, Combinatorica 18 (1998), 27-35], or as a characterization of large subsets of the 1\ell^1-grid whose edge-boundary is small. We use it to prove a result on the structure of Lipschitz functions between two discrete tori; this can be seen as a discrete, quantitative analogue of a recent result of Austin [T. Austin, On the failure of concentration for the \ell^{\infty}-ball, preprint]. We also prove a refined version of our junta theorem, which is sharp in a wider range of cases.

Keywords

Cite

@article{arxiv.1311.6958,
  title  = {Juntas in the $\ell^{1}$-grid and Lipschitz maps between discrete tori},
  author = {Itai Benjamini and David Ellis and Ehud Friedgut and Nathan Keller and Arnab Sen},
  journal= {arXiv preprint arXiv:1311.6958},
  year   = {2015}
}

Comments

29 pages. A mistake in Example 2 (pointed out by an anonymous referee) has now been corrected