11.07.2015 Views

International Congress of Mathematicians

International Congress of Mathematicians

International Congress of Mathematicians

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Exponential Sums and Diophantine Problems 209An asymptotic formula for R(n), with leading term determined by the majorarc contribution (1.1), now follows provided that the corresponding contributionarising from the minor arcs m = [0,1) \ 9Jt is asymptotically smaller. Although suchis conjectured to hold as soon as s > max{4,fc + 1}, this is currently known onlyfor larger values <strong>of</strong> s. It is here that energy is focused in current research. Onetypically estimates the minor arc contribution via an inequality <strong>of</strong> the typef(a) s e(—na)da < ( sup \f(a)\ ) / |/(a)| 2 *do;. (1.2)\aGm / JoFor suitable choices <strong>of</strong> t and Q, one now seeks bounds <strong>of</strong> the shapesup \f(a)\ -C F!- T+e and f \f(a)\ 2t da -C p?t-k+s+^ ^aGmJOwith r > 0 and Ö small enough that (s — 2t)r > Ö. The right hand side <strong>of</strong> (1.2) isthen o(n s / k ~ r ), which is smaller than the main term <strong>of</strong> (1.1) whenever & s ,k(n) ^ 1-The latter is assured provided that non-singular p-adic solutions can be found foreach prime p, and in any case when s > 4k. Classically, one has two apparentlyincompatibleapproaches toward establishing the estimates (1.3). On one side isthe differencing approach introduced by Weyl [23], and pursued by Hua [9], thatyields an asymptotic formula for R(n) whenever s > 2 k + 1. The ideas introducedby Vinogradov [21], meanwhile, provide the desired asymptotic formula when s >Ck 2 log k, for a suitable positive constant C.2. Efficient differencing and smooth Weyl sumsSince the seminal work <strong>of</strong> Vaughan [15], progress on diagonal diophantineproblems has been based, almost exclusively, on the use <strong>of</strong> smooth numbers, bywhich we mean integers free <strong>of</strong> large prime factors. In brief, one seeks serviceablesubstitutes for the estimates (1.3) with the underlying summands restricted to besmooth, the hope being that this restriction might lead to sharper bounds. Beforedescribing the kind <strong>of</strong> conclusions now available, we must introduce some notation.Let A(P, R) denote the set <strong>of</strong> natural numbers not exceeding F, all <strong>of</strong> whose primedivisors are at most F, and define the associated exponential sum h(a) = h(a; P, R)byh(a;P,R)= J^ e(ax k ).xeA(P,R)When £ is a positive integer, we consider the mean value St(P, R) = J 0 \h(a)\ 2t da,which, by orthogonality, is equal to the number <strong>of</strong> solutions <strong>of</strong> the diophantineequation x\ + • • • + x k = y\ + • • • + y k , with x»,y, £ A(P, R) (1 < i < t). Wetake F x P v in the ensuing discussion, with n a small positive number 2 . In these2 We adopt the convention that whenever r} appears in a statement, implicitly or explicitly,then it is asserted that the statement holds whenever r\ > 0 is sufficiently small in terms <strong>of</strong> e.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!