Irit Dinur ; Yuval Filmus ; Prahladh Harsha - Sparse juntas on the biased hypercube

theoretics:11523 - TheoretiCS, July 30, 2024, Volume 3 - https://doi.org/10.46298/theoretics.24.18
Sparse juntas on the biased hypercubeArticle

Authors: Irit Dinur ORCID; Yuval Filmus ORCID; Prahladh Harsha ORCID

We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas. Our structure theorem implies that such functions are $O(\epsilon^{C_d} + p)$-close to constant functions. We pinpoint the exact value of the constant $C_d$. We also give an analogous result for monotone Boolean functions on the biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse DNFs. Our structure theorems are optimal in the following sense: for every $d,\epsilon,p$, we identify a class $\mathcal{F}_{d,\epsilon,p}$ of degree $d$ sparse juntas which are $O(\epsilon)$-close to Boolean (in the monotone case, width $d$ sparse DNFs) such that a Boolean function on the $p$-biased hypercube is $O(\epsilon)$-close to degree $d$ in $L_2$ iff it is $O(\epsilon)$-close to a function in $\mathcal{F}_{d,\epsilon,p}$.

Comment: 44 pages. TheoretiCS journal article


Volume: Volume 3
Published on: July 30, 2024
Accepted on: May 25, 2024
Submitted on: June 30, 2023
Keywords: Computer Science - Computational Complexity, Mathematics - Combinatorics
Funding:
    Source : OpenAIRE Graph
  • Discrete harmonic analysis for computer science; Funder: European Commission; Code: 802020
  • Probabilistically Checkable Proofs, Agreement Tests, and High Dimensional Expanders; Funder: European Commission; Code: 772839

1 Document citing this article

Consultation statistics

This page has been seen 555 times.
This article's PDF has been downloaded 323 times.