On Vu's restricted box estimate in Waring's problem
Pith reviewed 2026-05-15 03:20 UTC · model grok-4.3
classification
🧮 math.NT
keywords
arbitraryboundcdotserrorestimateexpectedhardy--littlewoodnumber
The pith
The restricted box estimate in Waring's problem holds with power-saving error for s at least k squared minus k plus order square root of k, improving on the prior exponential threshold.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Waring's problem asks how many ways a large number N can be written as a sum of k-th powers of integers. The Hardy-Littlewood circle method gives a main term plus error for the count of solutions. When the integers are forced to lie inside an arbitrary box, extra work is needed to control the error. Vu showed in 2000 that if you allow enough powers, specifically more than a constant times 8 to the k times k cubed, then the count still obeys the expected upper bound with a power-saving error. This paper lowers the required number of powers to about k squared minus k plus a square-root term in k. The improvement comes from a more careful analysis of the minor arcs or the contribution from the box boundaries in the exponential sums. The result is still an upper bound only, not a full asymptotic, but it applies to smaller s than before.
Core claim
We show that one may take s ≥ k² - k + O(√k).
Load-bearing premise
The minor-arc estimates or box-restriction handling in the circle method continue to deliver a power-saving error once s reaches the new quadratic threshold; this is not verified from the abstract alone.
read the original abstract
In 2000, Vu proved that the number of solutions of $x_1^k + \cdots + x_s^k = N$ in an arbitrary box satisfies the expected Hardy--Littlewood upper bound with a power-saving error term, for $s \geq O(8^k k^3)$. We show that one may take $s\geq k^2 - k + O(\sqrt{k})$.
Editorial analysis
A structured set of objections, weighed in public.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Minor-arc estimates in the Hardy-Littlewood circle method deliver a power-saving error term once s exceeds the stated quadratic threshold.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.