scholarly journals Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers

2016 ◽  
Vol 152 (6) ◽  
pp. 1121-1158 ◽  
Author(s):  
Adam J. Harper

We investigate exponential sums over those numbers ${\leqslant}x$ all of whose prime factors are ${\leqslant}y$. We prove fairly good minor arc estimates, valid whenever $\log ^{3}x\leqslant y\leqslant x^{1/3}$. Then we prove sharp upper bounds for the $p$th moment of (possibly weighted) sums, for any real $p>2$ and $\log ^{C(p)}x\leqslant y\leqslant x$. Our proof develops an argument of Bourgain, showing that this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$-smooth integers less than $x$ whenever $\log ^{C}x\leqslant y\leqslant x$. Previously this was only known assuming the generalised Riemann hypothesis. Combining them with transference machinery of Green, we prove Roth’s theorem for subsets of the $y$-smooth numbers whenever $\log ^{C}x\leqslant y\leqslant x$. This provides a deterministic set, of size ${\approx}x^{1-c}$, inside which Roth’s theorem holds.

In the past few years considerable progress has been made with regard to the known upper bounds for G ( k ) in Waring’s problem, that is, the smallest s such that every sufficiently large natural number is the sum of at most 8 k th powers of natural numbers. This has come about through the development of techniques using properties of numbers having only relatively small prime factors. In this article an account of these developments is given, and they are illustrated initially in a historical perspective through the special case of cubes. In particular the connection with the classical work of Davenport on smaller values of k is demonstrated. It is apparent that the fundamental ideas and the underlying mean value theorems and estimates for exponential sums have numerous applications and a brief account is given of some of them.


An integer is called y-smooth if all of its prime factors are ⩽ y . An important problem is to show that the y -smooth integers up to x are equi-distributed among short intervals. In particular, for many applications we would like to know that if y is an arbitrarily small, fixed power of x then all intervals of length x up to x , contain, asymptotically, the same number of y -smooth integers. We come close to this objective by proving that such y -smooth integers are so equi-distributed in intervals of length x y 2 + ε , for any fixed ε < 0.


2001 ◽  
Vol 163 ◽  
pp. 13-53 ◽  
Author(s):  
Jörg Brüdern ◽  
Trevor D. Wooley

We establish that almost all natural numbers not congruent to 5 modulo 9 are the sum of three cubes and a sixth power of natural numbers, and show, moreover, that the number of such representations is almost always of the expected order of magnitude. As a corollary, the number of representations of a large integer as the sum of six cubes and two sixth powers has the expected order of magnitude. Our results depend on a certain seventh moment of cubic Weyl sums restricted to minor arcs, the latest developments in the theory of exponential sums over smooth numbers, and recent technology for controlling the major arcs in the Hardy-Littlewood method, together with the use of a novel quasi-smooth set of integers.


2013 ◽  
Vol 89 (2) ◽  
pp. 300-307
Author(s):  
IGOR E. SHPARLINSKI

AbstractWe use bounds of mixed character sum to study the distribution of solutions to certain polynomial systems of congruences modulo a prime $p$. In particular, we obtain nontrivial results about the number of solutions in boxes with the side length below ${p}^{1/ 2} $, which seems to be the limit of more general methods based on the bounds of exponential sums along varieties.


2013 ◽  
Vol 89 (3) ◽  
pp. 353-359
Author(s):  
YONG-GAO CHEN ◽  
CUI-E TANG

AbstractIn this paper, we prove that, if $N$ is a positive odd number with $r$ distinct prime factors such that $N\mid \sigma (N)$, then $N\lt {2}^{{4}^{r} - {2}^{r} } $ and $N{\mathop{\prod }\nolimits}_{p\mid N} p\lt {2}^{{4}^{r} } $, where $\sigma (N)$ is the sum of all positive divisors of $N$. In particular, these bounds hold if $N$ is an odd perfect number.


Author(s):  
J. BOURGAIN ◽  
M. Z. GARAEV

AbstractLet Fp be the field of a prime order p and F*p be its multiplicative subgroup. In this paper we obtain a variant of sum-product estimates which in particular implies the bound for any subset A ⊂ Fp with 1 < |A| < p12/23. Then we apply our estimate to obtain explicit bounds for some exponential sums in Fp. We show that for any subsets X, Y, Z ⊂ F*p and any complex numbers αx, βy, γz with |αx| ≤ 1, |βy| ≤ 1, |γz| ≤ 1, the following bound holds: We apply this bound further to show that if H is a subgroup of F*p with |H| > p1/4, then Finally we show that if g is a generator of F*p then for any M < p the number of solutions of the equation is less than $M^{3-1/24+o(1)}\Bigl(1+(M^2/p)^{1/24}\Bigr).$. This implies that if p1/2 < M < p, then


2016 ◽  
Vol 12 (02) ◽  
pp. 323-340 ◽  
Author(s):  
Kaisa Matomäki

In this paper, we prove that, for any positive constants [Formula: see text] and [Formula: see text] and every large enough [Formula: see text], the interval [Formula: see text] contains numbers whose all prime factors are smaller than [Formula: see text].


2010 ◽  
Vol 47 (1) ◽  
pp. 157-178 ◽  
Author(s):  
Frosso S. Makri

Consider a sequence of exchangeable or independent binary trials ordered on a line or on a circle. The statistics denoting the number of times an F-S string of length (at least) k1 + k2, that is, (at least) k1 failures followed by (at least) k2 successes in n such trials, are studied. The associated waiting time for the rth occurrence of an F-S string of length (at least) k1 + k2 in linearly ordered trials is also examined. Exact formulae, lower/upper bounds and approximations are derived for their distributions. Mean values and variances of the number of occurrences of F-S strings are given in exact formulae too. Particular exchangeable and independent sequences of binary random variables, used in applied research, combined with numerical examples clarify further the theoretical results.


2004 ◽  
Vol 56 (2) ◽  
pp. 356-372 ◽  
Author(s):  
M. Ram Murty ◽  
Filip Saidak

AbstractLet a be a natural number greater than 1. Let fa(n) be the order of a mod n. Denote by ω(n) the number of distinct prime factors of n. Assuming a weak form of the generalised Riemann hypothesis, we prove the following conjecture of Erdös and Pomerance:The number of n ≤ x coprime to a satisfyingis asymptotic to as x tends to infinity.


Sign in / Sign up

Export Citation Format

Share Document