Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1711.00762

Improved Lower Bounds for the Fourier Entropy/Influence Conjecture via Lexicographic Functions

Rani Hod
View original source ↗Read source document ↗Export metadata ↓

Abstract

Every Boolean function can be uniquely represented as a multilinear polynomial. The entropy and the total influence are two ways to measure the concentration of its Fourier coefficients, namely the monomial coefficients in this representation: the entropy roughly measures their spread, while the total influence measures their average level. The Fourier Entropy/Influence conjecture of Friedgut and Kalai from 1996 states that the entropy to influence ratio is bounded by a universal constant $C$. Using lexicographic Boolean functions, we present three explicit asymptotic constructions that improve upon the previously best known lower bound $C>6.278944$ by O'Donnell and Tan, obtained via recursive composition. The first uses their construction with the lexicographic function $\ell\left\langle 2/3\right\rangle $ of measure $2/3$ to demonstrate that $C\ge4+3\log_{4}3>6.377444$. The second generalizes their construction to biased functions and obtains $C>6.413846$ using $\ell\left\langle \Phi\right\rangle $, where $\Phi$ is the inverse golden ratio. The third, independent, construction gives $C>6.454784$, even for monotone functions. Beyond modest improvements to the value of $C$, our constructions shed some new light on the properties sought in potential counterexamples to the conjecture. Additionally, we prove a Lipschitz-type condition on the total influence and spectral entropy, which may be of independent interest.

Explore related subjects

cs.CCmath.CO

Keep this discovery

BibTeXRIS

Rani Hod. 2017-11-02. Improved Lower Bounds for the Fourier Entropy/Influence Conjecture via Lexicographic Functions. https://arxiv.org/abs/1711.00762

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗