XOR lemmas for resilient functions against polynomials
Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman
Abstract
A major challenge in complexity theory is to explicitly construct functions that have small correlation with low-degree polynomials over F 2 . We introduce a new technique to prove such correlation bounds with F 2 polynomials. Using this technique, we bound the correlation of an XOR of Majorities with constant degree polynomials. In fact, we prove a more general XOR lemma that extends to arbitrary resilient functions. We conjecture that the technique generalizes to higher degree polynomials as well.
A key ingredient in our new approach is a structural result about the Fourier spectrum of low degree polynomials over F 2 . We show that for any n-variate polynomial p over F 2 of degree at most d, there is a small set S ⊂ [n] of variables, such that almost all of the Fourier mass of p lies on Fourier coefficients that intersect with S. In fact our result is more general, and finds such a set S for any low-dimensional subspace of polynomials. This generality is crucial in deriving the new XOR lemmas.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4d0cf637-fe0b-4dae-828d-740e9f26af8fCited by top-tier papers3
- Locally Sampleable Uniform Symmetric DistributionsDaniel M. Kane, Anthony Ostuni, Kewen WuSTOC 2025 · 4 citations
- Efficient resilient functionsPeter Ivanov, Raghu Meka, Emanuele ViolaSODA 2023 · 3 citations
- Inverse-exponential correlation bounds and extremely rigid matrices from a new derandomized XOR lemmaLijie Chen, Xin LyuSTOC 2021 · 1 citation
Related papers
- On Approximability of Satisfiable k-CSPs: IIIAmey Bhangale, Subhash Khot, Dor MinzerSTOC 2023 · 8 citations
- Fourier Growth of Communication Protocols for XOR FunctionsUma Girish, Makrand Sinha, Avishay Tal, Kewen WuFOCS 2023 · 1 citation
- A near-optimal quadratic Goldreich-Levin algorithm (extended abstract)Jop Briët, Davi Castro-SilvaSODA 2026 · 1 citation
- Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract)Huacheng YuFOCS 2022 · 4 citations
- Reconstruction under outliers for Fourier-sparse functionsXue Chen, Anindya DeSODA 2020 · 1 citation
