• Home
  • Search
  • Harmonicity and invariance on slices of the Boolean cube
  • Cite Icon20
  • https://doi.org/10.1007/s00440-019-00900-wCopy DOI Icon

Harmonicity and invariance on slices of the Boolean cube

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In a recent work with Kindler and Wimmer we proved an invariance principle for the slice for low-influence, low-degree harmonic multilinear polynomials (a polynomial in $$x_1,\ldots ,x_n$$ is harmonic if it is annihilated by $$\sum _{i=1}^n \frac{\partial }{\partial x_i}$$ ). Here we provide an alternative proof for general low-degree harmonic multilinear polynomials, with no constraints on the influences. We show that any real-valued harmonic multilinear polynomial on the slice whose degree is $$o(\sqrt{n})$$ has approximately the same distribution under the slice and cube measures. Our proof is based on ideas and results from the representation theory of $$S_n$$ , along with 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, our decomposition is applied in a non-stationary non-reversible 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 known 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})$$ .

Similar Papers
  • Book Chapter

Analogies between harmonic and subharmonic functions

  • Jan 01, 1937
  • Tibor Radó
  • Research Article

On a Property of Harmonic Functions

  • Mar 31, 1995
  • Zeitschrift für Analysis und ihre Anwendungen
  • Ivan Keglević
  • Research Article

Hidden tail chains and recurrence equations for dependence parameters associated with extremes of stationary higher-order Markov chains

  • Dec 02, 2024
  • Advances in Applied Probability
  • Ioannis Papastathopoulos +2
  • Research Article

Algebraic Immunity, Correlation Immunity and other Cryptographic Properties of Quadratic Rotation Symmetric Boolean Functions

  • Jul 01, 2014
  • Advanced Materials Research
  • Jing Lian Huang +2
  • Supplementary Content

On the probabilistic degree of an n-variate boolean function

  • Sep 01, 2021
  • Srikanth Srinivasan +1
  • Conference Article
  • Citations39

Every locally characterized affine-invariant property is testable

  • Jun 01, 2013
  • Arnab Bhattacharyya +4
  • Book Chapter
  • Citations3

Best Approximations to Polynomials in the Mean and Norms of Coefficient-Functionals

  • Jan 01, 1979
  • Manfred Reimer
  • Book Chapter
  • Citations2

Finding More Boolean Functions with Maximum Algebraic Immunity Based on Univariate Polynomial Representation

  • Jan 01, 2011
  • Yusong Du +1
  • PDF
  • Research Article
  • Citations6

Application of Markov processes for analysis and control of aircraft maintainability

  • Feb 26, 2020
  • Civil Aviation High Technologies
  • Yu M Chinyuchin +1
  • Research Article
  • Citations5

Polynomial-Time Algorithms for Checking Some Properties of Boolean Functions Given by Polynomials

  • Nov 23, 2014
  • Theory of Computing Systems
  • Svetlana N Selezneva +1
  • Research Article
  • Citations20

An improved hybrid genetic algorithm to construct balanced Boolean function with optimal cryptographic properties

  • Jan 03, 2021
  • Evolutionary Intelligence
  • Pratap Kumar Behera +1
  • Conference Article

On cryptography properties of algebraic thickness

  • Jul 01, 2011
  • Yu Zhou +5
  • Research Article

Maximal k-Intersecting Families of Subsets and Boolean Functions

  • Oct 01, 2018
  • Journal of Applied and Industrial Mathematics
  • Yu A Zuev
  • Research Article
  • Citations17

Wireless Network Optimization by Perron-Frobenius Theory

  • Jan 18, 2023
  • Foundations and Trends® in Communications and Information Theory
  • Emmanuel Abbe +3
  • Research Article
  • Citations75

Reed–Muller Codes: Theory and Algorithms

  • May 20, 2020
  • IEEE Transactions on Information Theory
  • Emmanuel Abbe +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.