Metraipolis › archive › dc_080c3b70f7b8

An $m^{2.943}$ Bohnenblust--Hille Bound on the Boolean Cube — arXiv:2609.21144

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21144
License (as archived)
CC0-1.0
Archived
2026-10-10T02:20:03.139Z
SHA-256 of the archived text
2927db4d76963cdf13d7160daf2a80f9805f66e2f017e22b23510f07f761e59b
Stable URL of this page
https://metraipolis.com/documento/dc_080c3b70f7b8

How to cite

An $m^{2.943}$ Bohnenblust--Hille Bound on the Boolean Cube — arXiv:2609.21144 — arXiv (en), https://arxiv.org/abs/2609.21144 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_080c3b70f7b8 (Metraipolis archive dc_080c3b70f7b8, sha256 2927db4d76963cdf13d7160daf2a80f9805f66e2f017e22b23510f07f761e59b)
BibTeX
@misc{dc080c3b70f7b8,
  title = {An $m^2.943$ Bohnenblust--Hille Bound on the Boolean Cube — arXiv:2609.21144},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21144},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_080c3b70f7b8; sha256 2927db4d76963cdf13d7160daf2a80f9805f66e2f017e22b23510f07f761e59b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21144. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $q_m=2m/(m+1)$ and put \[ \beta_0=\frac{3}{2}+\frac{1}{\log 2}=2.9426950408\ldots, \] where $\log$ is the natural logarithm. We give a proof scheme showing that, for every $\varepsilon>0$, there is $C_\varepsilon<\infty$ such that every complex-valued function $f:\{-1,1\}^n\to\C$ of Fourier degree at most $m$ satisfies \[ \left(\sum_{A\subseteq[n]}\abs{\wh f(A)}^{q_m}\right)^{1/q_m} \le C_\varepsilon m^{\beta_0+\varepsilon}\norm{f}_\infty. \] The improvement over the $m^9$ estimate of the earlier draft has two ingredients. The first three Fourier levels are estimated at the scales $m$, $m^{3/2}$, and $m^{5/3}$. These losses are encoded in the weight $M^{\mu_r/r}r^B\min\{r,L_M\}^8$, $L_M\asymp_B \log (M+1)$, with $\mu_r=\lceil3r/2\rceil$ for $r\ge2$. A parity-compatible central window handles $r<L_M$, while a shrinking balanced window handles $r\ge L_M\asymp_B\log(M+1)$, no parity is used in this regime. The leading high-degree loss--gain factor is $\ee\,2^{-B}$; careful uniform bounds close the bootstrap for every $B>1/\log2$. The formula for $\mu_r$ is explained below.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Analysis of PDEs (math.AP); Classical Analysis and ODEs (math.CA).
Pagina del lavoro: https://arxiv.org/abs/2609.21144 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T02:04:28.727Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).