ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD
|
|
- Ruby Sullivan
- 5 years ago
- Views:
Transcription
1 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L In memoriam Professor Yu. V. Linnik Abstract. Let α m and β n be two sequences of real numbers supported on [M, 2M] and [N, 2N] with M = X /2 δ and N = X /2+δ. We show that there exists a δ 0 > 0 such that the multiplicative convolution of α m and β n has exponent of distribution 2 + δ ε in a weak sense as long as 0 δ < δ 0, the sequence β n is Siegel-Walfisz and both sequences α m and β n are bounded above by divisor functions. Our result is thus a general dispersion estimate for narrow type-ii sums. The proof relies crucially on Linnik s dispersion method and recent bounds for trilinear forms in Kloosterman fractions due to Bettin-Chandee. We highlight an application related to the Titchmarsh divisor problem.. Introduction An important theme in analytic number theory is the study of the distribution of sequences in arithmetic progressions. A representative result in this field is the Bombieri-Vinogradov theorem [2], according to which for any A > 0, max a,q= q Q p x p a mod q ϕq A xlog x A provided that Q xlog x B for some constant B = BA depending on A > 0. Nothing of the strength of is known in the range Q > x /2+ε for any fixed ε > 0 and already establishing for any fixed integer a 0 and for all A > 0 the weaker estimate, a,a xlog x A 2 ϕq q Q p x p a mod q with Q = x /2+δ and some δ > 0 is a major open problem. If we could show 2 then we would say that the primes have exponent of distribution + δ in a weak sense. 2 However we note that there are results of this type if one allows to restrict the sum Date: December 4, Mathematics Subject Classification. Primary N69. Key words and phrases. equidistribution in arithmetic progressions, dispersion method. p x p x
2 2 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L over q Q in 2 to integers that are x ε smooth, for a sufficiently small ε > 0 see [6, 5]. Any known approach to 2 goes through combinatorial formulas which decompose the sequence of prime numbers as a linear combination of multiplicative convolutions of other sequences see for example [3, Chapter 3]. If one attempts to establish 2 by using such a combinatorial formula then one is led to the problem of showing that for any A > 0, q Q q,a= M m 2M N n 2N mn a mod q α m β n ϕq M m 2M N n 2N mn,q= α m β n Xlog X A, X := MN 3 with Q > X /2+ε for some ε > 0. In [4] Linnik developed his dispersion method to tackle such expressions. The method relies crucially on the bilinearity of the problem, followed by the use of various estimates for Kloosterman sums of analytic or algebraic origins. For a bound such as 3 to hold one needs to impose a Siegel- Walfisz condition on at least one of the sequences α m or β n. Definition. We say that a sequence β = β n satisfies a Siegel-Walfisz condition alternatively we also say that β is Siegel-Walfisz, if there exists an integer k > 0 such that for any fixed A > 0, uniformly in x 2, q > a, r and a, q =, we have, x<n 2x n a mod q n,r= β n ϕq x<n 2x n,qr= where τ k n := n...n k =n is the kth divisor function. β n = O A τ k r xlog x A. It is widely expected see e.g [3, Conjecture ] that 3 should hold as soon as minm, N > X ε provided that at least one of the sequences α n, β m is Siegel-Walfisz, and that there exists an integer k > 0 such that α m τ k m and β n τ k n for all integers m, n. We are however very far from proving a result of this type. When Q > X /2+ε for some ε > 0, there are only a few results establishing 3 unconditionally in specific ranges of M and N precisely [9, Théorème ], [3, Theorem 3], [, Corollaire ], [2, Corollary. i]. All the results that establish 3 unconditionally place a restriction on one of the variable N or M being much smaller than the other. We call such cases unbalanced convolutions and this forms the topic of our previous paper [2]. In applications a recurring range is one where M and N are roughly of the same size. This often corresponds to the case of type II sums in which one is permitted to exploit bilinearity but not much else. This is the range to which we contribute in this paper.
3 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 3 Theorem.. Let k be an integer and M, N be given. Set X = MN. Let α m and β n be two sequences of real numbers supported respectively on [M, 2M] and [N, 2N]. Suppose that β = β n is Siegel Walfisz and suppose that α m τ k m and β n τ k n for all integers m, n. Then, for every ε > 0 and every A > 0, Q q 2Q q,a= mn a mod q α m β n ϕq mn,q= uniformly in N 56/23 X 7/23+ε Q NX ε and a X. α m β n A Xlog X A 4 Setting N = X /2+δ and M = X /2 δ in Theorem. it follows from Theorem. and the Bombieri-Vinogradov theorem that 4 holds for all Q NX ε with 0 δ < δ 0 :=. Previously the existence of such a δ 2 0 > 0 was established conditionally on Hooley s R conjecture on cancellations in short incomplete Kloosterman sums in [8, Théorème ] and in that case one can take δ 0 =. Similarly to our previous 4 paper, we use the work of Bettin-Chandee [] and Duke-Friedlander-Iwaniec [7] as an unconditional substitute for Hooley s R conjecture. In fact the proof of Theorem. follows closely the proof of the conditional result in [8, Théorème ] up to the point where Hooley s R conjecture is applied. Incidentally we notice that the largest Q that Theorem. allows to take is Q = X 7/33 5ε provided that one chooses N = X 7/33 4ε. Unfortunately the type-ii sums that our Theorem. allows to estimate are too narrow to make Theorem. widely applicable in many problems however see [5] for an interesting connection with cancellations in character sums. We record nonetheless below one corollary, which is related to Titchmarsh s divisor problem concerning the estimation of p x τ 2p for the best results on this problem see [0, Corollaire 2], [3, Corollary ] and [6]. The proof of the Corollary below will be given in 5. Corollary.. Let k and let α and β be two sequences of real numbers as in Theorem.. Let δ be a constant satisfying 0 < δ < 2, and let X 2, M = X /2 δ, and N = X /2+δ. Then for every A > 0 we have the equality α m β n τ 2 mn = 2 α m β n + O Xlog X A. ϕq m M q m M, mn>q 2 mn,q=
4 4 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L 2. Conventions and lemmas 2.. Conventions. For M and N, we put X = MN and L = log 2X. Whenever it appears in the subscript of a sum the notation n N will means N n < 2N. Given an integer a 0 and two sequences α = α m M m<2m and β = β n N n<2n supported respectively on [M, 2M] and [N, 2N] we define the discrepancy Eα, β, M, N, q, a := α m β n α m β n, ϕq m M, mn a mod q and we also define the mean-discrepancy, α, β, M, N, q, a := q Q q,a= m M, mn,q= Eα, β, M, N, q, a. 5 Throughout η will denote any positive number the value of which may change at each occurence. The dependency on η will not be recalled in the O or symbols. Typical examples are τ k n = On η or log x 0 = Ox η, uniformly for x. If f is a smooth real function, its Fourier transform is defined by where e = exp2πi. ˆfξ = fte ξt dt, 2.2. Lemmas. Our first lemma is a classical finite version of the Poisson summation formula in arithmetic progressions, with a good error term. Lemma 2.. There exists a smooth function ψ : R R +, with compact support equal to [/2, 5/2], larger than the characteristic function of the interval [, 2], equal to on this interval such that, uniformly for integers a and q, for M and H q/m log 4 2M one has the equality m ψ = M ˆψ0 M q + M e ah ˆψ h + OM. 6 q q q/m m a mod q 0< h H Furthermore, uniformly for q and M one has the equality m ψ = ϕq ˆψ0M + O τ 2 q log 4 2M. 7 M q m,q= Proof. See Lemma 2. of [2], inspired by [4, Lemma 7]. We now recall a classical lemma on the average behavior of the τ k -function in arithmetic progressions see [4, Lemma..5], for instance.
5 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 5 Lemma 2.2. For every k, for every ε > 0, there exists Ck, ε such that, for every x 2, for every x ε < y < x, for every q yx ε, for every integer a coprime with q, one has the inequality y τ k n Ck, ε x y<n x n a mod q ϕq log 2xk. The following lemma is one of the various forms of the so called Barban Davenport Halberstam Theorem for a proof see for instance [3, Theorem 0 a]. Lemma 2.3. Let k > 0 be an integer. Let β = β n be a Siegel Walfisz sequence such that β n τ k n for all integer n. Then for every A > 0 there exists B = BA such that, uniformly for N one has the equality q Nlog 2N B a, a,q= n a mod q β n ϕq n,q= β n 2 = OA Nlog 2N A. We now recall an easy consequence of Weil s bound for Kloosterman sums. Lemma 2.4. Let a and b two integers. Let I an interval included in [, a]. Then for every integer l for every ε > 0 we have the inequality n l ϕn e n = O ε l, a 2 ab ε a 2. a n I n,ab= Proof. We begin we the case b =. We write the factor n ϕn = ν = ν, ν n κν n n as ϕn where κν is the largest squarefree integer dividing ν sometimes κν is called the kernel of ν. This gives the equality n I n,a= n ϕn e l n a ν ν n I κν n n,a= e l n = ν a ν ν,a= m I/κν m,a= e l κν m a In the summation we can restrict to the ν such that κν a. Applying the classical bound for short Kloosterman sums, we deduce that ε l, a 2 a 2 +2ε. n I n,a= n ϕn e l n a ε l, a 2 a 2 +ε p a p.
6 6 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L This proves Lemma 2.4 in the case where b =. When b, we use the Möbius inversion formula to detect the condition n, b =. Our central tool is a bound for trilinear forms for Kloosterman fractions, due to Bettin and Chandee [, Theorem ]. The result of Bettin-Chandee builds on work of Duke-Friedlander-Iwaniec [7, Theorem 2] who considered the case of bilinear forms. These two papers show cancellations in exponential sums involving Kloosterman fractions eam/n with m n. We state below the main theorem of Bettin-Chandee. Lemma 2.5. For every ɛ > 0 there exists Cε such that for every non zero integer ϑ, for every sequences let α, β and ν be of complex numbers, for every A, M and N, one has the inequality αmβnνae ϑ am Cε α 2,M β 2,N ν 2,A n a A m M + ϑ A MN 2 AMN ε M + N AMN 8 +ε AM + AN Proof of Theorem. All along the proof we will suppose that the inequality a X holds and that we also have X 3 8 M X 2 N and Q N Beginning of the dispersion. Without loss of generality we can suppose that the sequence β satisfies the following property n a β n = 0. 9 Such an assumption is justified because the contribution to α, β, M, N, Q, a of the q, m, n such that n a is QX η + X η τ 2 mn a + MX ε M + QX η. n a m M mn a By 5, we have the inequality α, β, M, N, Q, a q Q m M m,q= α m n am mod q β n ϕq n,q= Let ψ be the smooth function constructed in Lemma 2.. By the Cauchy Schwarz inequality, the inequality α m τ k m and by Lemma 2.2 we deduce { } 2 α, β, M, N, Q, a MQL k2 W Q 2V Q + UQ, 0 β n.
7 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 7 with UQ = q,a= V Q = q,a= W Q = q,a= ψq/q ϕ 2 q ψq/q ϕq n,q= n N n,q= ψq/q n N n,q= β n 2 m,q= β n n 2 N n 2,q= β n n 2 N n 2,q= m ψ, M β n2 β n2 m an mod q m an mod q m an 2 mod q m ψ, M m ψ. 2 M 3.2. Study of UQ. A direct application of 7 of Lemma 2. in the definition gives the equality by definition. UQ = ˆψ0M q,a= ψq/q qϕq n,q= β n 2 + O N 2 Q X η = U MT Q + O N 2 Q X η, Study of V Q. Let ε be a fixed positive number. We now apply 6 of Lemma 2. with This leads to the equality H = M QX ε. 4 V Q = V MT Q + V Err Q + V Err2 Q, 5 where each of the three terms corresponds to the contribution of the three terms on the right hand side of 6. We directly have the equality For the main term we get V Err2 Q = O M N 2 X η. 6 V MT Q = ˆψ0M q,a= ψq/q qϕq n,q= β n 2. 7
8 8 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L By the definition of V Err Q we have the equality V Err Q = M q,a= ψq/q qϕq n 2 N n 2,q= from which we deduce the inequality V Err Q MQ 2 with Vn, n 2, h = n N q,an n 2 = β n2 β n n N n,q= n 2 N β n2 β n 0< h H 0< h H ψq/q Q2 qϕq ˆψ h e q/m Since q, n = Bézout s relation gives the equality ahn q = ah q n + ah n q mod. h ˆψ e q/m ahn q, Vn, n 2, h 8 ahn By the inequality a X and by the definition of H, the derivative of the bounded function t ψt/q Q2 t ˆψ h ah e 2 t/m n t is X ε t when t Q. This allows to make a partial summation over the variable q with the loss of a factor X ε. After all these considerations, we see that there exists a subinterval J [Q/2, 5Q/2] such that we have the inequality Vn, n 2, h X ε q ϕq e ah q. n q J q,n n 2 = Lemma 2.4 leads to the bound Vn, n 2, h X ε ah, n 2 n n 2 η n 2. Inserting this into 8, we obtain V Err Q MN 3 2 Q 2 X ε+η which finally gives n N β n 0< h H q h, n 2, V Err Q N 5 2 Q X 2ε+η 9.
9 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 9 using the inequality β n τ k n and the definition of H. Combining 5, 6, 7 and 9 we obtain the equality V Q = V MT Q + O ε M N 2 + N 5 2 Q X 2ε+η. 20 where V MT Q is defined in 7 and where the constant implicit in the O ε symbol is uniform for a satisfying a X. 4. Study of W Q 4.. The preparation of the variables. The conditions of the last summation in 2 imply the congruence restriction n n 2 mod q and n n 2, q =. 2 In order to control the mutual multiplicative properties of n and n 2 we decompose these variables as n, n 2 = d, n = dν, n 2 = dν 2, ν, ν 2 =, ν = d ν with d d and ν, d =. 22 Thanks to β n τ k n and to 9 the contribution of the pairs n, n 2 with d > X ε to the right hand side of 2 is negligible since it is X η X η X ε <d 2N m M X ε <d 2N m M ν N/d q Q ν 2 N/d dmν a 0 q dν m a ν 2 ν mod q ν N/d dmν a 0 N τ 2 dν m a dq + MN 2 Q X η ε + X +η. 23
10 0 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L Now consider the contribution of the pairs n, n 2 with d X ε and d > X ε to the right hand side of 2. It is X η d X ε X η d X ε X ε <d <2N d d X ε <d <2N d d m M m M X η MN 2 Q d X ε d 2 ν N/dd q Q ν 2 N/d dd mν a 0 q dd ν m a ν 2 d ν mod q ν N/dd dd mν a 0 d >X ε d d N τ 2 dd ν m a dq + + X η MN d d d X ε d >X ε d d MN 2 Q X η ε 2 + X +η ε Consider the conditions d < X ε and d < X ε, 25 and the subsum W Q of W Q where the variables n and n 2 satisfy the condition 25. By 23 and 24 we have the equality W Q = W Q + O MN 2 Q X η ε 2 + X +η Expansion in Fourier series. We apply Lemma 2. to the last sum over m in 2 with H defined in 4. This decomposes W Q into the sum W Q = W MT Q + W Err Q + W Err2 Q, 27 where each of the three terms corresponds to the contribution of each term on the right hand side of 6. The easiest term is W Err2 Q since, by β n τ k n and 8, it satisfies the inequality W Err2 Q M τ k n τ k n 2 Q/2 q 5Q/2 n,n 2 N n n 2 mod q M N 2 X η 28 According to the restriction 2, we see that the main term is W MT Q = ˆψ0M ψq/q q β n β n2, 29 q,a= δ,q= n,n 2 N n n 2 δ mod q d
11 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD where the variables n and n 2 satisfy the conditions 25. By a similar computation leading to 23 and 24 we can drop these conditions at the cost of the same error term. In other words the equality 29 can be written as W MT Q = W MT Q + O MN 2 Q X η ε 2 + X +η, 30 where W MT Q is the new main term, which is defined by W MT Q = ˆψ0M ψq/q q q,a= δ,q= n δ mod q β n Dealing with the main terms. We now gather the main terms appearing in 3, 7, 26, 27, 30, and in 3. The main term of W Q 2V Q + UQ is W MT Q 2V MT Q + U MT Q = ˆψ0M q,a= ψq/q q δ,q= n δ mod q β n ϕq n,q= Appealing to Lemma 2.3 we deduce that, for any A, we have the equality W MT Q 2V MT Q + U MT Q = O M Q N 2 log 2N A β n provided that for some B = BA. Q Nlog 2N B, Preparation of the exponential sums. By the definition 27, we have the equality W Err Q = M ψq/q h ahn β n β n2 ˆψ e, q q/m q q n,n 2 N n n 2 mod q 0< h H where the variables n, n 2 are such the associated d and d satisfy 25. This implies that any pair n, n 2 satisfies n n 2 0 and since we have n n 2 mod q see 2 these integers cannot be near to each other, indeed they satisfy the inequality n n 2 Q/2. Since we have n n 2, q =, we can equivalently write the congruence n n 2 0 mod q as ν ν 2 = d ν ν 2 = qr, 34
12 2 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L and instead of summing over q, we will sum over r. Note that r R/d, where R = 2NQ. 35 In the summations, the pair of variables n, n 2 is replaced by the quadruple d, d, ν, ν 2 see 22. The variables d and d are small, so we expect no substantial cancellations when summing over them. Hence for some we have the inequality d, d X ε, d d, W Err Q X 2ε MQ W, 36 where W = Wd, d is the quadrilinear form in the four variables r, ν, ν 2 and h defined by W = β dd ν β ψ d ν ν 2 /rq dν 2 d ν ν 2 /rq r R/d dd ν,dν 2 N d ν ν 2 mod r 0< h H ˆψ where e is the oscillating factor ah dd ν e = e, d ν ν 2 /r h d ν ν 2 /rm and where the variables satisfy the following divisibility conditions: d ν, ν 2 =, ν, d = and dd ν r, d ν ν 2 = r. Using Bézout s reciprocity formula we transform the factor e as follows: e, 37 ah dd ν d ν ν 2 /r = ahd ν ν 2 /r ahr + mod. dd ν dd ν d ν ν 2 Since dd, ν = r, ν = we can apply Bézout formula again, giving the equalities ah d ν ν 2 /r dd ν = ah ν d ν ν 2 /r dd + ah dd d ν ν 2 /r ν mod = ah ν d ν ν 2 /r ah rdd ν 2 mod dd ν The first term on the right hand side of the above equality depends only on the congruences classes of a, h, r, ν and ν 2 modulo dd. As a consequence of the above discussion, we see that there exists a coefficient ξ = ξa, h, r, ν, ν 2 of modulus,
13 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 3 depending only on the congruence classes of a, h, r, ν and ν 2 modulo dd such that we have the equality ahr ahrdd ν 2 e = ξ e e. dd ν d ν ν 2 Returning to 37, and fixing the congruences classes modulo dd of the variables h, r, ν and ν 2, we see that there exists such that W satisfies the inequality, W X 6ε r R/d r a mod dd dd ν, dν 2 N d ν ν 2 mod r ν a 2 mod dd ν 2 a 3 mod dd where Ψ r is the differentiable function Ψ r h, ν, ν 2 = ψ d ν ν 2 /rq ˆψ d ν ν 2 /rq 0 a, a 2, a 3, a 4 < dd ν β dd ν β ahrdd ν 2, dν 2 Ψ r h, ν, ν 2 e 38 ν h H h a 4 mod dd h d ν ν 2 /rm e ahr dd ν d ν ν 2 In order to perform the Abel summation over the variables ν, ν 2 and h see for instance [9, Lemme 5] we must have information on the partial derivatives of the Ψ r function. Indeed for 0 ɛ 0, ɛ, ɛ 2, we have the inequality ɛ 0+ɛ +ɛ 2 h ɛ 0 ν ɛ ν ɛ Ψ 2 r h, ν, ν 2 X 50ε h ɛ 0 ν ɛ ɛ ν 2 ɛ +ɛ 2 N/rQ 2, 39 2 as a consequence of the inequality d ν ν 2 rq/2 see34, of the definition of H see 4 and of the inequality a X. Since d ν ν 2, r = we detect the congruence d ν ν 2 mod r by the ϕr Dirichlet characters χ modulo r. By 39 we eliminate the function Ψ r in the inequality 38 which becomes W X 60ε N 2 Q 2 r R/d r a mod dd dd ν N dν 2 N 2 ν a 2 mod dd ν 2 a 3 mod dd ϕr r 2 χ mod r χdν χν 2 β dd ν β dν 2 where N and N 2 are two intervals included in [N, 2N], e h H h a 4 mod dd, ahrdd ν 2, 40 ν
14 4 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L and where H is the union of two intervals included in [ H, ] and [, H] respectively. Denote by W r, χ the inner sum over ν, ν 2 and h in 40. Remark that the trivial bound for W r, χ is OX η HN 2 /d 2 d. We now can apply Lemma 2.5 to the sum W r, χ, with the choice of parameters ϑ ar, A H, M N and N N. We obtain the bound W r, χ H 2 N 2 N 2 X ε+η a r H + HN 2 7 N ε N 4 + HN ε HN 8. By the definition 35, 4 and the inequality a X we deduce the inequality W r, χ X 4ε+η H N 20 + HN 8, and using 4 we finally deduce W r, χ X 5ε+η M 7 20 N Q M N 5 8 Q. Returning to 40, summing over χ and r and inserting into 36 we obtain the bound W Err Q X 67ε+η M 3 20 N Q N 3 8 Q Conclusion. We have now all the elements to bound α, β, M, N, Q, a. By 0, 3, 20, 26, 27, 28, 30 and 4 we have the inequality { 2 MQL k2 W MT Q 2V MT Q + U MT Q + N 2 Q X η + M N 2 + N 5 2 Q X 2ε+η + MN 2 Q X η ε 2 + X +η +X 67ε+η M 3 20 N Q N 3 8 Q 2 }, which is shortened in recall 8 { 2 MQL k2 MN 2 Q log 2N A + by 32 and 33 if one assumes + MN 2 Q X η ε 2 + X 67ε+η M 3 20 N Q N 3 8 Q 2 }, Q NX ε. 42 To finish the proof of Theorem., it remains to find sufficient conditions over M, N and Q to ensure the bound 2 M 2 N 2 L A. Choosing η = ε/5, we have to study
15 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 5 the following three inequalities hold MQ MN 2 Q X ε 4 M 2 N 2 X ε 4, MQ M 3 20 N Q X 68ε M 2 N 2 X ε 4, MQ N 3 8 Q 2 X 68ε M 2 N 2 X ε 4. The first inequality is trivially satisfied. The second inequality of 43 is satisfied as soon as Q > N X ε. 44 This inequality combined with 42 implies that N < X The last condition of 43 is satisfied as soon as Q > N 23 8 X +69ε. We can drop this condition since it is a consequence of 44 and of the inequality N < X The proof of Theorem. is now complete. 5. Proof of Corollary. Let SM, N be the sum we are studying in this corollary. We use Dirichlet s hyperbola argument to write mn = qr, 45 and by symmetry we can impose the condition q < r. This symmetry creates a factor 2 unless mn is a perfect square. The contribution to SM, N of the m, n such that mn is a square is bounded by OX 2 +η with η > 0 arbitrary. This is a consequence of β n τ k n. The decomposition 45, the constraint q < r and the inequalities X mn < 4X imply that q 2X 2. In counterpart, if q < X 2 we are sure that q < r. Thus we have the equality SM, N = 2 α m β n + 2 α m β n + OX 2 +η q X /2 m M, mn mod q mn =qr,q<r m M, X /2 <q 2X /2 43 = 2S 0 M, N + 2S M, N + OX 2 +η, 46 by definition. A direct application of Theorem. with Q = X 2 gives the equality S 0 M, N = α m β n + OXL C, 47 ϕq q X /2 m M, mn,q= for any C. For the second term S M, N, we must get rid of the constraint q < r. A technique among others is to precisely control the size of the variables m, n and q. If it is so,
16 6 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L then r = mn /q is also controlled and one can check if it satisfies r > q. We introduce the following factor of dissection: = 2 [L B ], where B = BA is a parameter to be fixed later, and where [y] is the largest integer y. If we denote by L 0 = [L B ] we see that L 0 = 2 and that = + OL B. We denote by M 0, N 0 and Q 0 any numbers in the sets M 0 := {M, M, 2 M, 3 M,, L 0 M} N 0 := {N, N, 2 N, 3 N,, L 0 N} Q 0 := {X 2, X 2, 2 X 2, 3 X 2,, L 0 X 2 }, respectively. We split S M, N into S M, N = M 0 M 0 N 0 N 0 where S M 0, N 0, Q 0 is defined by S M 0, N 0, Q 0 = q Q 0 Q 0 Q 0 S M 0, N 0, Q 0, 48 m M 0,n N 0 mn mod q α m β n. where the notation y Y 0 means that the integer y satisfies the inequalities Y 0 y < Y 0, where the variables m, n and q satisfy the extra condition Note that the decomposition 48 contains mn > q OL 3B, 50 terms. Since mn M 0 N 0 and q 2 < Q in each sum S M 0, N 0, Q 0, we can drop the condition 49 in the definition of this sum as soon as we have M 0 N 0 > Q When 5 is satisfied, the variables m, n and q are independent and a direct application of Theorem. gives for each sum S M 0, N 0, Q 0, the equality S M 0, N 0, Q 0 = α m β n + O C XL C, 52 ϕq q Q 0 where C is arbitrary. m M 0,n N 0 mn,q=
17 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 7 It remains to consider the case where 5 is not satisfied, which means that M 0, N 0, Q 0 E 0 where E 0 := { M 0, N 0, Q 0 ; M 0 N 0 Q 2 0 2}. 53 We now show that the variable n considered in such a S M 0, N 0, Q 0 varies in a rather short interval. More precisely, since M 0 > m, N 0 > n and Q 0 < q we deduce from the definition 53 that q 2 mn 4 2 which implies the inequality q mn 2 2. Combining with 49, we get the inequality mn 2 2 < q < mn 2 which implies Using the inequality q 2 /m < n < q + 2 /m 4. X /2 q 2X /2 Q 2 /M 4 X δ 2, and β n τ k n we apply Lemma 2.2 to see that M 0,N 0,Q 0 E 0 S M 0, N 0, Q 0 m M τ k m q X /2 q,m= 4 L k m M L 2k 2 B X. q 2 /m<n<q+ 2 /m 4 τ k n τ k m q X /2 ϕq q2 m Actually, by introducing a main term back, which is less than the error term, we can also write this bound as an equality M 0,N 0,Q 0 E 0 S M 0, N 0, Q 0 = M 0,N 0,Q 0 E 0 ϕq q Q 0 m M 0,n N 0 mn,q= where the variables m, n, q continue to satisfy 49. α m β n + OL 2k 2 B, 54
18 8 ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L Gathering 46, 47, 48, 50, 52, 54 we obtain SM, N = 2 ϕq q X /2 + 2 M 0 M 0 α m β n m M, mn,q= N 0 N 0 ϕq Q 0 Q 0 q Q 0 m M 0,n N 0 mn,q= α m β n + OL 3B C X + OL 2k 2 B X + OX 2 +η, where the variables m, n, q continue to satisfy 49. Putting the different summations back together, we complete the proof of Corollary. by choosing B and C in order to satisfy the equalities A = 3B C = 2k 2 B. References [] S. Bettin and V. Chandee. Trilinear forms with Kloosterman fractions. Adv. Math., 328: , 208. [2] E. Bombieri. Le grand crible dans la théorie analytique des nombres. Société Mathématique de France, Paris, 974. Avec une sommaire en anglais, Astérisque, No. 8. [3] E. Bombieri, J. B. Friedlander, and H. Iwaniec. Primes in arithmetic progressions to large moduli. Acta Math., 563-4:203 25, 986. [4] E. Bombieri, J. B. Friedlander, and H. Iwaniec. Primes in arithmetic progressions to large moduli. II. Math. Ann., 2773:36 393, 987. [5] W. Castryck, É. Fouvry, G. Harcos, E. Kowalski, P. Michel, P. Nelson, E. Paldi, J. Pintz, A. V. Sutherland, T. Tao, and X-F. Xie. New equidistribution estimates of Zhang type. Algebra Number Theory, 89: , 204. [6] S. Drappeau. Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method. Proc. Lond. Math. Soc. 3, 44: , 207. [7] W. Duke, J. Friedlander, and H. Iwaniec. Bilinear forms with Kloosterman fractions. Invent. Math., 28:23 43, 997. [8] É. Fouvry. Répartition des suites dans les progressions arithmétiques. Acta Arith., 44: , 982. [9] É. Fouvry. Autour du théorème de Bombieri-Vinogradov. Acta Math., 523-4:29 244, 984. [0] É. Fouvry. Sur le problème des diviseurs de Titchmarsh. J. Reine Angew. Math., 357:5 76, 985. [] É. Fouvry. Autour du théorème de Bombieri-Vinogradov. II. Ann. Sci. École Norm. Sup. 4, 204:67 640, 987. [2] É. Fouvry and M. Radziwi l l. Level of distribution of unbalanced sequences. pre-print, 208. [3] H. Iwaniec and E. Kowalski. Analytic number theory, volume 53 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, [4] Ju. V. Linnik. The dispersion method in binary additive problems. Translated by S. Schuur. American Mathematical Society, Providence, R.I., 963.
19 ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD 9 [5] T. Tao. The Elliott-Halberstam conjecture implies the Vinogradov least quadratic nonresidue conjecture. Algebra Number Theory, 94: , 205. [6] Y. Zhang. Bounded gaps between primes. Ann. of Math. 2, 793:2 74, 204. Laboratoire de Mathématiques d Orsay, Univ. Paris Sud, CNRS, Université Paris Saclay, 9405 Orsay, France address: Etienne.Fouvry@u-psud.fr Department of Mathematics, Caltech, 200 E California Blvd, Pasadena, CA, 925 address: maksym.radziwill@gmail.com
Small gaps between primes
CRM, Université de Montréal Princeton/IAS Number Theory Seminar March 2014 Introduction Question What is lim inf n (p n+1 p n )? In particular, is it finite? Introduction Question What is lim inf n (p
More informationON THE GREATEST PRIME FACTOR OF ab + 1. Étienne Fouvry 1
Indian J. Pure Appl. Math., 45(5): 583-632, October 2014 c Indian National Science Academy ON THE GREATEST PRIME FACTOR OF ab + 1 Étienne Fouvry 1 Univ. Paris Sud, Laboratoire de Mathématiques d Orsay,
More informationAnalytic Number Theory
American Mathematical Society Colloquium Publications Volume 53 Analytic Number Theory Henryk Iwaniec Emmanuel Kowalski American Mathematical Society Providence, Rhode Island Contents Preface xi Introduction
More informationNew bounds on gaps between primes
New bounds on gaps between primes Andrew V. Sutherland Massachusetts Institute of Technology Brandeis-Harvard-MIT-Northeastern Joint Colloquium October 17, 2013 joint work with Wouter Castryck, Etienne
More informationBefore giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7. The Prime number theorem We denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.. We have π( as. log Before
More informationResearch Statement. Enrique Treviño. M<n N+M
Research Statement Enrique Treviño My research interests lie in elementary analytic number theory. Most of my work concerns finding explicit estimates for character sums. While these estimates are interesting
More informationArea, Lattice Points and Exponential Sums
Area, Lattice Points and Exponential Sums Martin N. Huxley School of Mathematics, University of Wales, College of Cardiff, Senghenydd Road Cardiff CF2 4AG. Wales, UK Suppose you have a closed curve. How
More informationNOTES ON ZHANG S PRIME GAPS PAPER
NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for
More informationSéminaire BOURBAKI March ème année, , n o 1084
Séminaire BOURBAKI March 2014 66ème année, 2013 2014, n o 1084 GAPS BETWEEN PRIME NUMBERS AND PRIMES IN ARITHMETIC PROGRESSIONS [after Y. Zhang and J. Maynard] by Emmanuel KOWALSKI... utinam intelligere
More informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationPrimes in arithmetic progressions to large moduli
CHAPTER 3 Primes in arithmetic progressions to large moduli In this section we prove the celebrated theorem of Bombieri and Vinogradov Theorem 3. (Bombieri-Vinogradov). For any A, thereeistsb = B(A) such
More informationTHE GENERALIZED ARTIN CONJECTURE AND ARITHMETIC ORBIFOLDS
THE GENERALIZED ARTIN CONJECTURE AND ARITHMETIC ORBIFOLDS M. RAM MURTY AND KATHLEEN L. PETERSEN Abstract. Let K be a number field with positive unit rank, and let O K denote the ring of integers of K.
More informationPATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS
PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS JÁNOS PINTZ Rényi Institute of the Hungarian Academy of Sciences CIRM, Dec. 13, 2016 2 1. Patterns of primes Notation: p n the n th prime, P = {p i } i=1,
More informationSéminaire BOURBAKI March ème année, , n o 1084
Séminaire BOURBAKI March 2014 66ème année, 2013 2014, n o 1084 GAPS BETWEEN PRIME NUMBERS AND PRIMES IN ARITHMETIC PROGRESSIONS [after Y. Zhang and J. Maynard] by Emmanuel KOWALSKI... utinam intelligere
More informationFermat numbers and integers of the form a k + a l + p α
ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac
More informationNUMBER FIELDS WITHOUT SMALL GENERATORS
NUMBER FIELDS WITHOUT SMALL GENERATORS JEFFREY D. VAALER AND MARTIN WIDMER Abstract. Let D > be an integer, and let b = b(d) > be its smallest divisor. We show that there are infinitely many number fields
More informationarxiv:math/ v3 [math.co] 15 Oct 2006
arxiv:math/060946v3 [math.co] 15 Oct 006 and SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds
More informationCharacter sums with Beatty sequences on Burgess-type intervals
Character sums with Beatty sequences on Burgess-type intervals William D. Banks Department of Mathematics University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu Igor E. Shparlinski Department
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationErgodic aspects of modern dynamics. Prime numbers in two bases
Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationOn the maximal exponent of the prime power divisor of integers
Acta Univ. Sapientiae, Mathematica, 7, 205 27 34 DOI: 0.55/ausm-205-0003 On the maimal eponent of the prime power divisor of integers Imre Kátai Faculty of Informatics Eötvös Loránd University Budapest,
More informationOn Gelfond s conjecture on the sum-of-digits function
On Gelfond s conjecture on the sum-of-digits function Joël RIVAT work in collaboration with Christian MAUDUIT Institut de Mathématiques de Luminy CNRS-UMR 6206, Aix-Marseille Université, France. rivat@iml.univ-mrs.fr
More informationSOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY
Annales Univ. Sci. Budapest., Sect. Comp. 43 204 253 265 SOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY Imre Kátai and Bui Minh Phong Budapest, Hungary Le Manh Thanh Hue, Vietnam Communicated
More informationExponential and character sums with Mersenne numbers
Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 652, USA bankswd@missouri.edu John B. Friedlander Dept. of Mathematics, University
More informationON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,
More informationBURGESS INEQUALITY IN F p 2. Mei-Chu Chang
BURGESS INEQUALITY IN F p 2 Mei-Chu Chang Abstract. Let be a nontrivial multiplicative character of F p 2. We obtain the following results.. Given ε > 0, there is δ > 0 such that if ω F p 2\F p and I,
More informationOn pseudosquares and pseudopowers
On pseudosquares and pseudopowers Carl Pomerance Department of Mathematics Dartmouth College Hanover, NH 03755-3551, USA carl.pomerance@dartmouth.edu Igor E. Shparlinski Department of Computing Macquarie
More informationSieve theory and small gaps between primes: Introduction
Sieve theory and small gaps between primes: Introduction Andrew V. Sutherland MASSACHUSETTS INSTITUTE OF TECHNOLOGY (on behalf of D.H.J. Polymath) Explicit Methods in Number Theory MATHEMATISCHES FORSCHUNGSINSTITUT
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationLes chiffres des nombres premiers. (Digits of prime numbers)
Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet
More informationLarge Sieves and Exponential Sums. Liangyi Zhao Thesis Director: Henryk Iwaniec
Large Sieves and Exponential Sums Liangyi Zhao Thesis Director: Henryk Iwaniec The large sieve was first intruded by Yuri Vladimirovich Linnik in 1941 and have been later refined by many, including Rényi,
More informationarxiv: v1 [math.nt] 4 Oct 2016
ON SOME MULTIPLE CHARACTER SUMS arxiv:1610.01061v1 [math.nt] 4 Oct 2016 ILYA D. SHKREDOV AND IGOR E. SHPARLINSKI Abstract. We improve a recent result of B. Hanson (2015) on multiplicative character sums
More informationON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE LIANGYI ZHAO INSTITUTIONEN FÖR MATEMATIK KUNGLIGA TEKNISKA HÖGSKOLAN (DEPT. OF MATH., ROYAL INST. OF OF TECH.) STOCKHOLM SWEDEN Dirichlet
More informationProducts of ratios of consecutive integers
Products of ratios of consecutive integers Régis de la Bretèche, Carl Pomerance & Gérald Tenenbaum 27/1/23, 9h26 For Jean-Louis Nicolas, on his sixtieth birthday 1. Introduction Let {ε n } 1 n
More informationOn the digital representation of smooth numbers
On the digital representation of smooth numbers Yann BUGEAUD and Haime KANEKO Abstract. Let b 2 be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer
More informationTowards the Twin Prime Conjecture
A talk given at the NCTS (Hsinchu, Taiwan, August 6, 2014) and Northwest Univ. (Xi an, October 26, 2014) and Center for Combinatorics, Nankai Univ. (Tianjin, Nov. 3, 2014) Towards the Twin Prime Conjecture
More informationEstimates for sums over primes
8 Estimates for sums over primes Let 8 Principles of the method S = n N fnλn If f is monotonic, then we can estimate S by using the Prime Number Theorem and integration by parts If f is multiplicative,
More informationShort character sums for composite moduli
Short character sums for composite moduli Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract We establish new estimates on short character sums for arbitrary
More informationDistribution of Prime Numbers Prime Constellations Diophantine Approximation. Prime Numbers. How Far Apart Are They? Stijn S.C. Hanson.
Distribution of How Far Apart Are They? June 13, 2014 Distribution of 1 Distribution of Behaviour of π(x) Behaviour of π(x; a, q) 2 Distance Between Neighbouring Primes Beyond Bounded Gaps 3 Classical
More information(Primes and) Squares modulo p
(Primes and) Squares modulo p Paul Pollack MAA Invited Paper Session on Accessible Problems in Modern Number Theory January 13, 2018 1 of 15 Question Consider the infinite arithmetic progression Does it
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More informationSOME REMARKS ON ARTIN'S CONJECTURE
Canad. Math. Bull. Vol. 30 (1), 1987 SOME REMARKS ON ARTIN'S CONJECTURE BY M. RAM MURTY AND S. SR1NIVASAN ABSTRACT. It is a classical conjecture of E. Artin that any integer a > 1 which is not a perfect
More informationarxiv: v1 [math.nt] 8 Apr 2016
MSC L05 N37 Short Kloosterman sums to powerful modulus MA Korolev arxiv:6040300v [mathnt] 8 Apr 06 Abstract We obtain the estimate of incomplete Kloosterman sum to powerful modulus q The length N of the
More informationDistribution of Fourier coefficients of primitive forms
Distribution of Fourier coefficients of primitive forms Jie WU Institut Élie Cartan Nancy CNRS et Nancy-Université, France Clermont-Ferrand, le 25 Juin 2008 2 Presented work [1] E. Kowalski, O. Robert
More informationCongruences among generalized Bernoulli numbers
ACTA ARITHMETICA LXXI.3 (1995) Congruences among generalized Bernoulli numbers by Janusz Szmidt (Warszawa), Jerzy Urbanowicz (Warszawa) and Don Zagier (Bonn) For a Dirichlet character χ modulo M, the generalized
More informationResults of modern sieve methods in prime number theory and more
Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications
More informationAVERAGE RECIPROCALS OF THE ORDER OF a MODULO n
AVERAGE RECIPROCALS OF THE ORDER OF a MODULO n KIM, SUNGJIN Abstract Let a > be an integer Denote by l an the multiplicative order of a modulo integers n We prove that l = an Oa ep 2 + o log log, n,n,a=
More informationOn the Fractional Parts of a n /n
On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
More informationEXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS
Annales Univ. Sci. Budapest. Sect. Comp. 48 018 5 3 EXPONENTIAL SUMS OVER THE SEQUENCES OF PRN S PRODUCED BY INVERSIVE GENERATORS Sergey Varbanets Odessa Ukraine Communicated by Imre Kátai Received February
More informationBURGESS BOUND FOR CHARACTER SUMS. 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1].
BURGESS BOUND FOR CHARACTER SUMS LIANGYI ZHAO 1. Introduction Here we give a survey on the bounds for character sums of D. A. Burgess [1]. We henceforth set (1.1) S χ (N) = χ(n), M
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationA COUNTEREXAMPLE TO AN ENDPOINT BILINEAR STRICHARTZ INEQUALITY TERENCE TAO. t L x (R R2 ) f L 2 x (R2 )
Electronic Journal of Differential Equations, Vol. 2006(2006), No. 5, pp. 6. ISSN: 072-669. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) A COUNTEREXAMPLE
More informationShort character sums for composite moduli
Short character sums for composite moduli Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract We establish new estimates on short character sums for arbitrary
More informationSUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS
SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds in finite fields using incidence theorems
More informationBILINEAR FORMS WITH KLOOSTERMAN SUMS
BILINEAR FORMS WITH KLOOSTERMAN SUMS 1. Introduction For K an arithmetic function α = (α m ) 1, β = (β) 1 it is often useful to estimate bilinear forms of the shape B(K, α, β) = α m β n K(mn). m n complex
More informationProjects on elliptic curves and modular forms
Projects on elliptic curves and modular forms Math 480, Spring 2010 In the following are 11 projects for this course. Some of the projects are rather ambitious and may very well be the topic of a master
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationOn sums of squares of primes
Under consideration for publication in ath. Proc. Camb. Phil. Soc. 1 On sums of squares of primes By GLYN HARAN Department of athematics, Royal Holloway University of London, Egham, Surrey TW 2 EX, U.K.
More informationUniformity of the Möbius function in F q [t]
Uniformity of the Möbius function in F q [t] Thái Hoàng Lê 1 & Pierre-Yves Bienvenu 2 1 University of Mississippi 2 University of Bristol January 13, 2018 Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity
More informationCharacter Sums to Smooth Moduli are Small
Canad. J. Math. Vol. 62 5), 200 pp. 099 5 doi:0.453/cjm-200-047-9 c Canadian Mathematical Society 200 Character Sums to Smooth Moduli are Small Leo Goldmakher Abstract. Recently, Granville and Soundararajan
More informationas x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.
Chapter 7 The Prime number theorem for arithmetic progressions 7.1 The Prime number theorem Denote by π( the number of primes. We prove the Prime Number Theorem. Theorem 7.1. We have π( log as. Before
More informationTHE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5
THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 JEREMY LOVEJOY Abstract. We establish a relationship between the factorization of n+1 and the 5-divisibility of Q(n, where Q(n is the number
More informationGoldbach's problem with primes in arithmetic progressions and in short intervals
Goldbach's problem with primes in arithmetic progressions and in short intervals Karin Halupczok Journées Arithmétiques 2011 in Vilnius, June 30, 2011 Abstract: We study the number of solutions in Goldbach's
More informationOn the second smallest prime non-residue
On the second smallest prime non-residue Kevin J. McGown 1 Department of Mathematics, University of California, San Diego, 9500 Gilman Drive, La Jolla, CA 92093 Abstract Let χ be a non-principal Dirichlet
More informationEXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER
EXPLICIT CONSTANTS IN AVERAGES INVOLVING THE MULTIPLICATIVE ORDER KIM, SUNGJIN DEPARTMENT OF MATHEMATICS UNIVERSITY OF CALIFORNIA, LOS ANGELES MATH SCIENCE BUILDING 667A E-MAIL: 70707@GMAILCOM Abstract
More informationOn the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences
On the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences J. C. Lagarias A.. Odlyzko J. B. Shearer* AT&T Labs - Research urray Hill, NJ 07974 1. Introduction
More informationOn prime factors of subset sums
On prime factors of subset sums by P. Erdös, A. Sárközy and C.L. Stewart * 1 Introduction For any set X let X denote its cardinality and for any integer n larger than one let ω(n) denote the number of
More informationOn prime factors of integers which are sums or shifted products. by C.L. Stewart (Waterloo)
On prime factors of integers which are sums or shifted products by C.L. Stewart (Waterloo) Abstract Let N be a positive integer and let A and B be subsets of {1,..., N}. In this article we discuss estimates
More informationHOW OFTEN IS EULER S TOTIENT A PERFECT POWER? 1. Introduction
HOW OFTEN IS EULER S TOTIENT A PERFECT POWER? PAUL POLLACK Abstract. Fix an integer k 2. We investigate the number of n x for which ϕn) is a perfect kth power. If we assume plausible conjectures on the
More informationA Remark on Sieving in Biased Coin Convolutions
A Remark on Sieving in Biased Coin Convolutions Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract In this work, we establish a nontrivial level of distribution
More informationOn the digits of prime numbers
On the digits of prime numbers Joël RIVAT Institut de Mathématiques de Luminy, Université d Aix-Marseille, France. rivat@iml.univ-mrs.fr work in collaboration with Christian MAUDUIT (Marseille) 1 p is
More informationTOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne
TOPICS IN NUMBER THEORY - EXERCISE SHEET I École Polytechnique Fédérale de Lausanne Exercise Non-vanishing of Dirichlet L-functions on the line Rs) = ) Let q and let χ be a Dirichlet character modulo q.
More informationApproximation exponents for algebraic functions in positive characteristic
ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions
More informationFOURIER COEFFICIENTS OF VECTOR-VALUED MODULAR FORMS OF DIMENSION 2
FOURIER COEFFICIENTS OF VECTOR-VALUED MODULAR FORMS OF DIMENSION 2 CAMERON FRANC AND GEOFFREY MASON Abstract. We prove the following Theorem. Suppose that F = (f 1, f 2 ) is a 2-dimensional vector-valued
More informationarxiv: v1 [math.nt] 5 Mar 2015
ON SUMS OF FOUR SQUARES OF PRIMES ANGEL KUMCHEV AND LILU ZHAO arxiv:1503.01799v1 [math.nt] 5 Mar 2015 Let Abstract. Let E(N) denote the number of positive integers n N, with n 4 (mod 24), which cannot
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationSome Arithmetic Functions Involving Exponential Divisors
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 200, Article 0.3.7 Some Arithmetic Functions Involving Exponential Divisors Xiaodong Cao Department of Mathematics and Physics Beijing Institute of Petro-Chemical
More informationIrrationality exponent and rational approximations with prescribed growth
Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing
More informationPELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série tome 05 207 23 245 https://doiorg/02298/pim7523f PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER Bernadette Faye and Florian Luca Abstract We show
More informationAverage Orders of Certain Arithmetical Functions
Average Orders of Certain Arithmetical Functions Kaneenika Sinha July 26, 2006 Department of Mathematics and Statistics, Queen s University, Kingston, Ontario, Canada K7L 3N6, email: skaneen@mast.queensu.ca
More informationIncomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
ACTA ARITHMETICA XCIII.4 (2000 Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators by Harald Niederreiter and Arne Winterhof (Wien 1. Introduction.
More informationLong Arithmetic Progressions in A + A + A with A a Prime Subset 1. Zhen Cui, Hongze Li and Boqing Xue 2
Long Arithmetic Progressions in A + A + A with A a Prime Subset 1 Zhen Cui, Hongze Li and Boqing Xue 2 Abstract If A is a dense subset of the integers, then A + A + A contains long arithmetic progressions.
More informationOn the representation of primes by polynomials (a survey of some recent results)
On the representation of primes by polynomials (a survey of some recent results) B.Z. Moroz 0. This survey article has appeared in: Proceedings of the Mathematical Institute of the Belarussian Academy
More informationCongruences involving product of intervals and sets with small multiplicative doubling modulo a prime
Congruences involving product of intervals and sets with small multiplicative doubling modulo a prime J. Cilleruelo and M. Z. Garaev Abstract We obtain a sharp upper bound estimate of the form Hp o(1)
More informationOn Roth's theorem concerning a cube and three cubes of primes. Citation Quarterly Journal Of Mathematics, 2004, v. 55 n. 3, p.
Title On Roth's theorem concerning a cube and three cubes of primes Authors) Ren, X; Tsang, KM Citation Quarterly Journal Of Mathematics, 004, v. 55 n. 3, p. 357-374 Issued Date 004 URL http://hdl.handle.net/107/75437
More informationON THE SUM OF DIVISORS FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 40 2013) 129 134 ON THE SUM OF DIVISORS FUNCTION N.L. Bassily Cairo, Egypt) Dedicated to Professors Zoltán Daróczy and Imre Kátai on their 75th anniversary Communicated
More informationIntegers without large prime factors in short intervals and arithmetic progressions
ACTA ARITHMETICA XCI.3 (1999 Integers without large prime factors in short intervals and arithmetic progressions by Glyn Harman (Cardiff 1. Introduction. Let Ψ(x, u denote the number of integers up to
More informationOn the low-lying zeros of elliptic curve L-functions
On the low-lying zeros of elliptic curve L-functions Joint Work with Stephan Baier Liangyi Zhao Nanyang Technological University Singapore The zeros of the Riemann zeta function The number of zeros ρ of
More informationEFFECTIVE MOMENTS OF DIRICHLET L-FUNCTIONS IN GALOIS ORBITS
EFFECTIVE MOMENTS OF DIRICHLET L-FUNCTIONS IN GALOIS ORBITS RIZWANUR KHAN, RUOYUN LEI, AND DJORDJE MILIĆEVIĆ Abstract. Khan, Milićević, and Ngo evaluated the second moment of L-functions associated to
More informationExact exponent in the remainder term of Gelfond s digit theorem in the binary case
ACTA ARITHMETICA 136.1 (2009) Exact exponent in the remainder term of Gelfond s digit theorem in the binary case by Vladimir Shevelev (Beer-Sheva) 1. Introduction. For integers m > 1 and a [0, m 1], define
More informationDiophantine Approximation by Cubes of Primes and an Almost Prime
Diophantine Approximation by Cubes of Primes and an Almost Prime A. Kumchev Abstract Let λ 1,..., λ s be non-zero with λ 1/λ 2 irrational and let S be the set of values attained by the form λ 1x 3 1 +
More informationResolving Grosswald s conjecture on GRH
Resolving Grosswald s conjecture on GRH Kevin McGown Department of Mathematics and Statistics California State University, Chico, CA, USA kmcgown@csuchico.edu Enrique Treviño Department of Mathematics
More informationON THE PSEUDORANDOMNESS OF THE SIGNS OF KLOOSTERMAN SUMS
J. Aust. Math. Soc. 77 (2004), 425 436 ON THE PSEUDORANDOMNESS OF THE SIGNS OF KLOOSTERMAN SUMS ÉTIENNE FOUVRY, PHILIPPE MICHEL, JOËL RIVAT and ANDRÁS SÁRKÖZY (Received 17 February 2003; revised 29 September
More informationPredictive criteria for the representation of primes by binary quadratic forms
ACTA ARITHMETICA LXX3 (1995) Predictive criteria for the representation of primes by binary quadratic forms by Joseph B Muskat (Ramat-Gan), Blair K Spearman (Kelowna, BC) and Kenneth S Williams (Ottawa,
More informationTHE SUM OF DIGITS OF PRIMES
THE SUM OF DIGITS OF PRIMES Michael Drmota joint work with Christian Mauduit and Joël Rivat Institute of Discrete Mathematics and Geometry Vienna University of Technology michael.drmota@tuwien.ac.at www.dmg.tuwien.ac.at/drmota/
More informationIntegers without divisors from a fixed arithmetic progression
Integers without divisors from a fixed arithmetic progression William D. Banks Department of Mathematics, University of Missouri Columbia, MO 65211 USA bbanks@math.missouri.edu John B. Friedlander Department
More informationChapter 2. Real Numbers. 1. Rational Numbers
Chapter 2. Real Numbers 1. Rational Numbers A commutative ring is called a field if its nonzero elements form a group under multiplication. Let (F, +, ) be a filed with 0 as its additive identity element
More informationPrime Numbers and Irrational Numbers
Chapter 4 Prime Numbers and Irrational Numbers Abstract The question of the existence of prime numbers in intervals is treated using the approximation of cardinal of the primes π(x) given by Lagrange.
More information