English

Fourier growth of structured $\mathbb{F}_2$-polynomials and applications

Computational Complexity 2024-10-15 v2

Abstract

We analyze the Fourier growth, i.e. the L1L_1 Fourier weight at level kk (denoted L1,kL_{1,k}), of various well-studied classes of "structured" F2\mathbb{F}_2-polynomials. This study is motivated by applications in pseudorandomness, in particular recent results and conjectures due to [CHHL19,CHLT19,CGLSS20] which show that upper bounds on Fourier growth (even at level k=2k=2) give unconditional pseudorandom generators. Our main structural results on Fourier growth are as follows: - We show that any symmetric degree-dd F2\mathbb{F}_2-polynomial pp has L1,k(p)Pr[p=1]O(d)kL_{1,k}(p) \le \Pr[p=1] \cdot O(d)^k, and this is tight for any constant kk. This quadratically strengthens an earlier bound that was implicit in [RSV13]. - We show that any read-Δ\Delta degree-dd F2\mathbb{F}_2-polynomial pp has L1,k(p)Pr[p=1](kΔd)O(k)L_{1,k}(p) \le \Pr[p=1] \cdot (k \Delta d)^{O(k)}. - We establish a composition theorem which gives L1,kL_{1,k} bounds on disjoint compositions of functions that are closed under restrictions and admit L1,kL_{1,k} bounds. Finally, we apply the above structural results to obtain new unconditional pseudorandom generators and new correlation bounds for various classes of F2\mathbb{F}_2-polynomials.

Keywords

Cite

@article{arxiv.2107.10797,
  title  = {Fourier growth of structured $\mathbb{F}_2$-polynomials and applications},
  author = {Jarosław Błasiok and Peter Ivanov and Yaonan Jin and Chin Ho Lee and Rocco A. Servedio and Emanuele Viola},
  journal= {arXiv preprint arXiv:2107.10797},
  year   = {2024}
}

Comments

Corrected a mistake in Lemma 27 in the previous version of the paper