Indexed metadata

Improved LpL^p maximal estimates for higher-degree Weyl sums

Xuezhi Chen, Changxing Miao, Jiye Yuan, Tengfei Zhao

Source record

Source: arXiv

Published: Oct 16, 2026

arXiv: 2610.23379

Open original source ↗

Source abstract

For each integer k≥3k\ge3, we establish the following estimate for all 1≤p01\le p 0: ∥sup⁡t∈T∣∑n=1Ne(nx+nkt)∣∥Lp(T)≪k,p,εNmax⁡{1−1/Kk, 1−1/p}+ε, \left\|\sup_{t\in\mathbb{T}}\left|\sum_{n=1}^N e(nx+n^kt)\right|\right\|_{L^p(\mathbb{T})} \ll_{k,p,\varepsilon} N^{\max\{1-1/K_k,\,1-1/p\}+\varepsilon}, where Kk=min⁡{2k−1,k(k+1)/2}K_k=\min\{2^{k-1},k(k+1)/2\}, e(z)=e2πize(z)=e^{2πiz}, and T=R/Z\mathbb{T}=\mathbb{R}/\mathbb{Z}. For k≥5k\ge5, this improves our earlier bound \cite{chen-miao-yuan-zhao} for 1≤p<Dk1\le p<D_k, where Dk=min⁡{2k−1,k(k−1)}D_k=\min\{2^{k-1},k(k-1)\}, and, together with the corresponding lower bound, extends the sharp range up to NεN^\varepsilon from p≥Dkp\ge D_k to p≥Kkp\ge K_k. The main new ingredient is a mixed minor-arc moment estimate obtained before taking the time supremum. The minor-arc maximal estimate then follows from a smooth reproducing kernel argument, while the major arcs are handled directly by Poisson summation and classical complete exponential-sum estimates. The reduction from suprema to mean values also yields a short and direct proof of improved LpL^p estimates for maximal operators on Weyl sums with general polynomial phases, strengthening \cite[Theorem 1.1]{baker-chen-shparlinski}.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.