Fourier growth of structured $\mathbb{F}_2$-polynomials and applications
Abstract
We analyze the Fourier growth, i.e. the Fourier weight at level (denoted ), of various well-studied classes of "structured" -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 ) give unconditional pseudorandom generators. Our main structural results on Fourier growth are as follows: - We show that any symmetric degree- -polynomial has , and this is tight for any constant . This quadratically strengthens an earlier bound that was implicit in [RSV13]. - We show that any read- degree- -polynomial has . - We establish a composition theorem which gives bounds on disjoint compositions of functions that are closed under restrictions and admit bounds. Finally, we apply the above structural results to obtain new unconditional pseudorandom generators and new correlation bounds for various classes of -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