Paper 2026/2032
Tight Constants in Talagrand's Boolean Convolution Inequality
Abstract
We study the optimal dimension-free constant $C_*(a)$ in Talagrand's Boolean convolution inequality $\Pr_\mu[T_af\ge u]\le C_*(a)/(u\sqrt{\log u})$, where $T_a$ is the noise operator, $\mu$ is the uniform measure on the Boolean cube, $f\ge0$ satisfies $\mathbb{E}_\mu[f]=1$, and $u>1$. We establish explicit upper bounds for every $0<a<1$ and prove $\limsup_{a\uparrow1}C_*(a)/\sqrt{\kappa_a}<0.3577$, where $\kappa_a:=(1+a)/(1-a)$. We establish the lower bound $\liminf_{a\uparrow1}C_*(a)/\sqrt{\kappa_a}\ge0.3570$.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- number theoryboolean function analysistalagrandconvolutionfinite field
- Contact author(s)
- magic linuxkde @ gmail com
- History
- 2026-09-17: approved
- 2026-09-14: received
- See all versions
- Short URL
- https://ia.cr/2026/2032
- License
-
CC BY-NC
BibTeX
@misc{cryptoeprint:2026/2032,
author = {Zhao Song},
title = {Tight Constants in Talagrand's Boolean Convolution Inequality},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2032},
year = {2026},
url = {https://eprint.iacr.org/2026/2032}
}