Sparse juntas on the biased hypercube
arXiv:1711.09428 · doi:10.46298/theoretics.24.18
Abstract
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 . We also give an analogous result for monotone Boolean functions on the biased hypercube which are -close to degree in , showing that they are close to sparse DNFs. Our structure theorems are optimal in the following sense: for every , we identify a class of degree sparse juntas which are -close to Boolean (in the monotone case, width sparse DNFs) such that a Boolean function on the -biased hypercube is -close to degree in iff it is -close to a function in .
44 pages. TheoretiCS journal article