Harmonicity and Invariance on Slices of the Boolean Cube

In a recent work with Kindler and Wimmer we proved an invariance principle for the slice for low-influence, low-degree functions. Here we provide an alternative proof for general low-degree functions, with no constraints on the influences. We show that any real-valued function on the slice, whose degree when written as a harmonic multi-linear polynomial is $o(\sqrt{n})$, has approximately the same distribution under the slice and cube measure. Our proof is based on a novel decomposition of random increasing paths in the cube in terms of martingales and reverse martingales. While such decompositions have been used in the past for stationary reversible Markov chains, ours decomposition is applied in a non-reversible non-stationary setup. We also provide simple proofs for some known and some new properties of harmonic functions which are crucial for the proof. Finally, we provide independent simple proofs for the facts that 1) one cannot distinguish between the slice and the cube based on functions of $o(n)$ coordinates and 2) Boolean symmetric functions on the cube cannot be approximated under the uniform measure by functions whose sum of influences is $o(\sqrt{n})$.

[1]  K. Oleszkiewicz On a Nonsymmetric Version of the Khinchine-Kahane Inequality , 2003 .

[2]  Guy Kindler,et al.  Invariance Principle on the Slice , 2015, CCC.

[3]  Dennis Stanton,et al.  Harmonics on Posets , 1985, J. Comb. Theory, Ser. A.

[4]  Andris Ambainis,et al.  Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing , 2015, SODA.

[5]  Philippe Delsarte,et al.  Association Schemes and t-Designs in Regular Semilattices , 1976, J. Comb. Theory A.

[6]  Ronald de Wolf,et al.  On the sum-of-squares degree of symmetric quadratic functions , 2016, CCC.

[7]  Grigoriy Blekherman,et al.  Sums of squares on the hypercube , 2014, 1402.4199.

[8]  W. Beckner Inequalities in Fourier analysis , 1975 .

[9]  A. Carbery,et al.  Distributional and L-q norm inequalities for polynomials over convex bodies in R-n , 2001 .

[10]  Lynne Seymour,et al.  Institute of Mathematical Statistics LECTURE NOTES ? MONOGRAPH SERIES , 2016 .

[11]  Y. Peres,et al.  Markov chains in smooth Banach spaces and Gromov hyperbolic metric spaces , 2004, math/0410422.

[12]  Yuval Filmus,et al.  An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube , 2014, Electron. J. Comb..

[13]  L. Turner,et al.  Inverse of the Vandermonde matrix with applications , 1966 .

[14]  François Bergeron,et al.  Algebraic Combinatorics and Coinvariant Spaces , 2009 .

[15]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[16]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[17]  Tzong-Yow Lee,et al.  Logarithmic Sobolev inequality for some models of random walks , 1998 .

[18]  Ryan O'Donnell,et al.  Approximation by DNF: Examples and Counterexamples , 2007, ICALP.

[19]  Bruce E. Sagan,et al.  The symmetric group - representations, combinatorial algorithms, and symmetric functions , 2001, Wadsworth & Brooks / Cole mathematics series.

[20]  M. Talagrand On Russo's Approximate Zero-One Law , 1994 .

[21]  Prasad Raghavendra,et al.  On the Bit Complexity of Sum-of-Squares Proofs , 2017, ICALP.

[22]  Murali K. Srinivasan Symmetric chains, Gelfand–Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme , 2010, 1001.0280.

[23]  P. Diaconis,et al.  LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .

[24]  Ravi B. Boppana,et al.  The Average Sensitivity of Bounded-Depth Circuits , 1997, Inf. Process. Lett..

[25]  Matematik Representation Theory of The Symmetric Group , 2010 .

[26]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[27]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[28]  Gordon James,et al.  A characteristic-free approach to the representation theory of Gn☆ , 1977 .

[29]  S. Safra,et al.  Noise-Resistant Boolean-Functions are Juntas , 2003 .

[30]  Karl Wimmer,et al.  Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates , 2014, 2014 IEEE 29th Conference on Computational Complexity (CCC).

[31]  Avishay Tal,et al.  Tight bounds on The Fourier Spectrum of AC0 , 2017, Electron. Colloquium Comput. Complex..

[32]  Guy Kindler,et al.  Property Testing, PCP, andJuntas , 2002, Electron. Colloquium Comput. Complex..

[33]  W. Hoeffding Probability Inequalities for sums of Bounded Random Variables , 1963 .

[34]  Terry Lyons,et al.  Decomposition of Dirichlet Processes and its Application , 1994 .