Fourier entropy of threshold functions and their compositions
Abstract
We prove the Fourier entropy--influence inequality for every linear threshold function, with a constant below $8.937$ and no restrictions on its weights or threshold. The argument applies to regular Boolean functions and gives logarithmic bounds for their Boolean combinations and for unions with bounded variable overlap. Character multiplication preserves the estimates and yields bounds by influence minus variance. Under arbitrary product measures, symmetric thresholds satisfy the strengthened inequality needed for read-once composition, uniformly in depth and fan-in. A joint description of each Fourier set refines the overlap estimate and recovers constant bounds for addressing. Exact selector identities extend the bound to orthogonal multiplexers with shared data. Rare activation preserves the optimal constant of unrestricted FEI. The proofs combine pivotal antichains, spectral reference measures, and product-measure composition.
Related
- On the Fourier Entropy-Influence Conjecture for Boolean Plateaued Functions
- A Two-regime Khintchine Inequality and an Improved Bound on the Degree-1 Fourier Weight for Linear Threshold Functions
- The Lorentz Threshold in Fourier Restriction
- Uniqueness and stability of entropy waves among vanishing dissipation limits from the Navier--Stokes--Fourier System
- Space curve Fourier restriction for orthonormal functions
BibTeX
@misc{shmalo2026fourier,
title = {{Fourier entropy of threshold functions and their compositions}},
author = {Yitzchak Shmalo},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16069},
eprint = {2610.16069},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16069},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Fourier entropy of threshold functions and their compositions
AU - Yitzchak Shmalo
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.16069
UR - https://arxiv.org/abs/2610.16069
AB - We prove the Fourier entropy--influence inequality for every linear threshold function, with a constant below $8.937$ and no restrictions on its weights or threshold. The argument applies to regular Boolean functions and gives logarithmic bounds for their Boolean combinations and for unions with bounded variable overlap. Character multiplication preserves the estimates and yields bounds by influence minus variance. Under arbitrary product measures, symmetric thresholds satisfy the strengthened inequality needed for read-once composition, uniformly in depth and fan-in. A joint description of each Fourier set refines the overlap estimate and recovers constant bounds for addressing. Exact selector identities extend the bound to orthogonal multiplexers with shared data. Rare activation preserves the optimal constant of unrestricted FEI. The proofs combine pivotal antichains, spectral reference measures, and product-measure composition.
ER -