Skip to content
Preprint

An $m^{2.943}$ Bohnenblust--Hille Bound on the Boolean Cube

Sep 2026 · 1 citation · ⚡ 1 influential · 22 references
Computer Science Mathematics

Abstract

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.

View source

Similar papers

Preprint Sep 2026

On the exponential sum over squarefree integers

Let $\mu$ be the M\"obius function and $e(t)=e^{2\pi it}$. We prove that if $N\ge2$, $\alpha\in\mathbb{R}$, $(a,q)=1$, and $|\alpha-a/q|\le q^{-2}$, then \[\bigg|\sum_{n\le N}\mu^2(n)e(\alpha n)\bigg|\ll\left(\frac Nq+q\right)(\log 2N)^5, \] with an absolute implied constant, and we deduce the corresponding estimate on...

Nicolas Robles, Alexandru Zaharescu, Dirk Zeindler · 0 citations
Preprint Sep 2026

Resolving a conjecture on permutation polynomials over $\mathbb{F}_{2^n}$

Let $\delta\in\mathbb{F}_{2^n}$ satisfy $\operatorname{Tr}_{\mathbb{F}_{2^n}/\mathbb{F}_2}(\delta)=1$. We study the permutation behavior of $$ f(x) = \left(\frac{1}{x^2+x+\delta}\right)^{2^k}+x $$ over $\mathbb{F}_{2^n}$. Helleseth and Zinoviev proved that $f(x)$ is a permutation for $k=0,1$, and remarked that numerica...

Yi Li · 0 citations
Preprint Sep 2026

A $(\log n)^{1/4}$ Bound for the Koml\'os Problem

Let $A\in\mathbb{R}^{m\times n}$ have columns of Euclidean norm at most one. We prove that $\operatorname{disc}(A)\le2395\left(1+\log_+\frac n9\right)^{1/4}+2\sqrt2$. Here $\log_+t=\max\{0,\log t\}$. Building on Bansal and Jiang's affine spectral independence framework, we remove the $(\log\log n)^{7/4}$ factor from th...

E. Ercan · 3 citations
Preprint Oct 2026

The sharp $L^2$-Michael--Simon inequality

Let $n \geq 3$. We prove that if $j \colon (\Sigma^n,g) \to (\mathbb{R}^N,dx^2)$ is an isometric immersion, then \begin{equation*} \int_\Sigma \left( \lvert \nabla u \rvert^2 + \frac{n(n-2)}{4}\lvert H \rvert^2 u^2 \right) \geq \frac{n(n-2)}{4}\mathrm{Vol}(S^n)^{2/n}\left( \int_\Sigma \lvert u \rvert^{\frac{2n}{n-2}} \...

Jeffrey S. Case, D. Mengesha · 2 citations · ⚡2
Preprint Sep 2026

Improved Weyl bounds on short intervals

For an integer $d\ge 3$, put $\Delta_d=\min{2^{d-1},d(d-1)}$. Let $a/q$ be reduced, let $P(X)=\frac{a}{q}X^d+\alpha_{d-1}X^{d-1}+\cdots+\alpha_0$, and let $\mathcal{I}$ be an interval of $H\le q$ consecutive integers. We prove $\left|\sum_{n\in\mathcal{I}}e(P(n))\right|\ll_{d,\varepsilon}q^{1/d}H^\varepsilon+H^{1-1/\De...

Xi-Yu Hu · 0 citations
Preprint Sep 2026

On Sarnak--Str\"{o}mbergsson conjecture

Let $\Th(\alpha,L)=\sum_{v\in L}e^{-\pi\alpha|v|^2}$ for $\alpha>0$ and $E(L,s)=\sum_{v\in L\setminus\{0\}}|v|^{-2s}$ for $s>3/2$ be the theta and Epstein zeta functions associated to the lattice $L$, respectively. We are particularly interested in physically relevant dimension three. Fix the covolume of the lattice $L...

Sen-Ping Luo, Jun-Cheng Wei · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.