Sparse juntas on the biased hypercube
Irit Dinur, Yuval Filmus and Prahladh Harsha
TheoretiCS
We give a structure theorem for Boolean functions on the biased hypercube which are -close to degree in , showing that they are close to sparse juntas.
Our structure theorem implies that such functions are -close to constant functions. We pinpoint the exact value of the constant .
This paper improves on our previous work in several ways:
- The main theorem now includes a true “if and only if” condition, in the style of the sharp FKN theorem on the symmetric group.
- In the monotone case, we provide a theorem in which the approximating function is a monotone DNF.
- We find the optimal value of , proving matching upper and lower bounds.
The previous work applied in the more general -valued setting. The proof in this work applies in that setting as well, but we only formulated it in the Boolean setting. The missing piece is the -valued Kindler–Safra theorem, which follows in a black-box function from the usual Kindler–Safra theorem, as outlined in the previous version.
@article{DFH2024,
author = {Irit Dinur and Yuval Filmus and Prahladh Harsha},
title = {Sparse juntas on the biased hypercube},
journal = {TheoretiCS},
volume = {3},
year = {2024},
doi = {10.46298/theoretics.24.18}
}
copy to clipboard