1 October 2003 On Vu's thin basis theorem in Waring's problem
Trevor D. Wooley
Duke Math. J. 120(1): 1-34 (1 October 2003). DOI: 10.1215/S0012-7094-03-12011-6

Abstract

V. Vu has recently shown that when k≥2 and s is sufficiently large in terms of k, then there exists a set X (k), whose number of elements up to t is smaller than a constant times (t log t)1/s, for which all large integers n are represented as the sum of s kth powers of elements of X (k) in order log n ways. We establish this conclusion with sk log k, improving on the constraint implicit in Vu's work which forces s to be as large as k48k. Indeed, the methods of this paper show, roughly speaking, that whenever existing methods permit one to show that all large integers are the sum of H(k) kth powers of natural numbers, then H(k)+2 variables suffice to obtain a corresponding conclusion for "thin sets," in the sense of Vu.

Citation

Download Citation

Trevor D. Wooley. "On Vu's thin basis theorem in Waring's problem." Duke Math. J. 120 (1) 1 - 34, 1 October 2003. https://doi.org/10.1215/S0012-7094-03-12011-6

Information

Published: 1 October 2003
First available in Project Euclid: 16 April 2004

zbMATH: 1047.11094
MathSciNet: MR2010732
Digital Object Identifier: 10.1215/S0012-7094-03-12011-6

Subjects:
Primary: 11P05 , O5D40

Rights: Copyright © 2003 Duke University Press

JOURNAL ARTICLE
34 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.120 • No. 1 • 1 October 2003
Back to Top