DOCSLIB.ORG

Exponential Sums: Normal Numbers and Waring's Problem

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Exponential Sums: Normal Numbers and Waring's Problem Manfred G. Madritsch Matrikelnummer 0130439 Exponential sums: Normal numbers and Waring's Problem Dissertation1 Ausgefuhrt¨ zum Zwecke der Erlangung des akademischen Grades eines Doktors der technischen Wissenschaften Betreuer: O. Univ.-Prof. Dr. Robert F. Tichy unter Mitwirkung von Ao. Univ.-Prof. Dr. J¨org M. Thuswaldner Eingereicht an der Technischen Universit¨at Graz Fakult¨at fur¨ Technische Mathematik und Technische Physik Graz, April 2008 1Supported by the Austrian Science Fund (FWF) FSP-Project S9603 and S9611 Preface If f : N ! R is a given arithmetic function then we call a sum of the form N X exp(2πif(n)) (∗) n=1 an exponential sum. These sums are a central tool in analytic number theory and have applica- tions in different areas such as in uniform distribution, counting zeros of ζ-functions and additive problems. We mention the seminal paper by Weyl from 1916, where he considered the uniform distribution of sequences (p(n))n≥1 where p is a polynomial. These considerations lead him to the statement of a criterion (later called Weyl's criterion) for a sequence to be uniformly distributed, saying that a sequence is uniformly distributed if and only if certain exponential sums have non-trivial estimates (cf. Theorem 1.3). Weyl's results where extended by Van der Corput. He improved Weyl's method in order to t estimate the Riemann zeta-function in the critical strip. In this case f(n) = − 2π log n in (∗). Another problem from the same context is the Dirichlet divisor problem. Let d(n) denote the number of divisors of the number n. Then one is interested in estimates of X ∆(x) = d(n) − x log x − (2γ − 1)x; n≤x where γ is Euler's constant. These sums are estimated by a Fourier transform of the function 1 (x) = x − bxc − 2 . Fourier transformation also plays a role in uniform distribution, especially in discrepancy theory, where one is interested in a function, that is a good approximation of an Urysohn function and which has a nice Fourier transform. These functions were introduced by Vinogradov and play a central role in the estimation of the discrepancy of normal numbers. The exponential sums occurring in the estimation of the Urysohn function where also considered by R.C. Baker in 1984. In particular he was able to show the uniform distribution of the values of certain entire functions. This was the starting point of my research work and will be described in Chapter 2 where we want to construct normal numbers with help of entire functions of the same type as those considered by Baker. The theoretical background to the used constructions and their motivation will be presented in Chapter 1. Chapter 3 will lead us a little bit away from the estimation of exponential sums. It contains preliminary results on normal numbers in matrix number systems that will be used later. Some of its results, however, are of interest on its own right. We consider normal numbers in different number systems, where these systems and the associated concept of normal numbers are introduced and described in Chapter 1. Moreover we show how one can extend the construction of Copeland and Erd}osto matrix number systems. In Chapter 4 we want to combine the methods used in Chapter 2 with the results of Chapter 3 in order to extend the construction by Nakai and Shiokawa to the Gaussian number systems. Therefore we have to estimate exponential sums over the Gaussian integers which are similar to the considerations of Hua and Wang, who introduced exponential sums in algebraic number fields. 2 3 Besides the construction of normal numbers and uniform distribution we are also concerned with applications of exponential sums in additive problems. The fundamental problem is to consider number of solutions of equations of the form N = x1 + ··· + xs (x1; : : : ; xs 2 S); where S is a subset of the positive integers. Interesting choices for S are for instance the k-th powers, the prime numbers, the k-th powers of prime numbers, the square-free numbers, the k-free numbers. The basic tool in the estimation of the numbers of solution is the orthogonality of the exponential sums, i.e., ( Z 1 1 if n=0, exp(2πiαn) = 0 0 otherwise. Then in order to apply the circle method one has to consider sums of the form N X exp(2πiαn); n=1 n2S where α is either in a Major or in a Minor arc. For S equal to the set of primes or the k-th powers of primes good estimates are due to Hua and Vinogradov. For the k-free numbers Br¨udern,Granville, Perelli, Vaughan, and Wooley give estimates. In our case we want to set S to a digitally restricted set. This is the set where the sum of digits function of every element fulfills certain congruence relations. These sets and their additive properties have been studied by Thuswaldner and Tichy in 2005. In Chapter 5 we consider generalizations of this problem to polynomials over function fields. The corresponding results for k-th powers, irreducible polynomials in this field were gained by Car, Hayes, Kubota and Webb. In the last Chapter I will present a recent result of a generalization of the additive problem with digital restrictions to function fields. The number systems and additive functions in this area are motivated by recent considerations of Scheicher and Thuswaldner. I would like to thank all those, who inspired and supported my work. In particular I want to thank Robert Tichy and J¨orgThuswaldner for their useful comments and hints, my office colleagues Christoph Aistleiter, Philipp Mayer, and Stephan Wagner, for our discussions about everything under the sun. I also have to thank the Austrian Science Fund - without their support it would have been impossible to write my thesis. Manfred Madritsch Contents 1 Introduction and definitions 5 1.1 Uniform distribution . 5 1.2 Number systems . 9 1.3 Normal numbers . 13 1.4 Waring's Problem . 17 1.5 Notes . 19 2 Generating normal numbers by entire functions 20 2.1 Notation . 21 2.2 Lemmas . 21 2.3 Value Distribution of Entire Functions . 23 2.4 Proof of Theorem 2.1 . 23 2.5 Proof of Theorem 2.2 . 29 3 Normal numbers in matrix number systems 33 3.1 Numbering the elements of a JTCS . 33 3.2 Ambiguous expansions in JTCS . 34 3.3 Proof of Theorem 3.1 . 36 4 Generating normal numbers over Gaussian integers 37 4.1 Preliminary Lemmata . 37 4.2 Properties of the Fundamental Domain . 39 4.3 The Weyl Sum . 41 4.4 Proof of Theorem 4.1 . 45 5 Weyl Sums in Fq[X] with digital restrictions 56 5.1 Introduction . 56 5.2 Preliminaries and statement of results . 57 5.3 Higher Correlation . 60 5.4 Weyl's Lemma for Q-additive functions . 67 5.5 Uniform Distribution . 69 5.6 Waring's Problem with digital restrictions . 72 6 Weyl Sums in Fq[X; Y ] with digital restrictions 76 6.1 Preliminaries and definitions . 76 6.2 Higher Correlation . 78 6.3 Weyl's Lemma . 81 6.4 Waring's Problem . 82 4 Chapter 1 Introduction and definitions We call a sum of the form N X S(f; N) := exp(2πif(n)) n=1 an exponential sum and we will write for short e(x) := exp(2πix), thus N X S(f; N) = e(f(n)): n=1 If f is a polynomial then the sum S(f; N) is also called a Weyl sum. Since e(·) is 1-periodic it suffices to consider the fractional part of a real number. We denote by fxg the fractional part of x and by kxk = minn2Z jx − nj the minimum distance to an integer. If there exists a positive integer q such that ff(n + q)g = ff(n)g holds for every integer n, then we call the sum q X Sq(f) := e(f(n)) n=1 a complete exponential sum. A simple example for a complete sum is if f is a polynomial with rational coefficients and least common denominator q, i.e., then ff(n + q)g = ff(n)g and q d X adx + ··· + a1x + a0 S (f) = e q q x=1 with ad 6≡ 0 (mod q). 1.1 Uniform distribution The formal definition of uniform distribution was given by Weyl [84]. For a good survey on that topic consider the book of Kuipers and Niederreiter [47]. Another book giving a very good and more recent view on that topic is the one of Drmota and Tichy [21]. In this section we mainly follow these to books in our definitions. Definition 1.1. We call a sequence (xn)n≥1 of real numbers uniformly distributed modulo 1 if for every pair 0 ≤ a < b ≤ 1 we have jf1 ≤ n ≤ N : fx g 2 [a; b)gj lim n = b − a N!1 N where jSj denotes the cardinality of S. This is equivalent to the following 5 CHAPTER 1. INTRODUCTION AND DEFINITIONS 6 Definition 1.2. A sequence (xn)n≥1 of real numbers is uniformly distributed modulo 1 if for every continuous real-valued function f defined on [0; 1] we have N X Z 1 lim f(fxng) = f(x)dx: N!1 n=1 0 Now we have reached the point where exponential sums come into play. They were introduced by Weyl in [84] in order to give the following criterion. Theorem 1.3 ([84] Weyl's criterion). A sequence (xn)n≥1 is uniformly distributed modulo 1 if and only if for every non-zero integer h X e(h · xn) = o(N): n≤N In the same paper Weyl applied this criterion to sequences (f(n)) ; n2N where f is a polynomial.
Load more

Recommended publications
  • Exponential Sums and the Distribution of Prime Numbers
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Helsingin yliopiston digitaalinen arkisto Exponential Sums and the Distribution of Prime Numbers Jori Merikoski HELSINGIN YLIOPISTO HELSINGFORS UNIVERSITET UNIVERSITY OF HELSINKI Tiedekunta/Osasto Fakultet/Sektion Faculty Laitos Institution Department Faculty of Science Department of Mathematics and Statistics Tekijä Författare Author Jori Merikoski Työn nimi Arbetets titel Title Exponential Sums and the Distribution of Prime Numbers Oppiaine Läroämne Subject Mathematics Työn laji Arbetets art Level Aika Datum Month and year Sivumäärä Sidoantal Number of pages Master's thesis February 2016 102 p. Tiivistelmä Referat Abstract We study growth estimates for the Riemann zeta function on the critical strip and their implications to the distribution of prime numbers. In particular, we use the growth estimates to prove the Hoheisel-Ingham Theorem, which gives an upper bound for the dierence between consecutive prime numbers. We also investigate the distribution of prime pairs, in connection which we oer original ideas. The Riemann zeta function is dened as s in the half-plane Re We extend ζ(s) := n∞=1 n− s > 1. it to a meromorphic function on the whole plane with a simple pole at s = 1, and show that it P satises the functional equation. We discuss two methods, van der Corput's and Vinogradov's, to give upper bounds for the growth of the zeta function on the critical strip 0 Re s 1. Both of ≤ ≤ these are based on the observation that ζ(s) is well approximated on the critical strip by a nite exponential sum T s T Van der Corput's method uses the Poisson n=1 n− = n=1 exp s log n .
    [Show full text]
  • Uniform Distribution of Sequences
    Alt 1-4 'A I #so 4, I s4.1 L" - _.u or- ''Ifi r '. ,- I 'may,, i ! :' m UNIFORM DISTRIHUTION OF SEQUENCES L. KUIPERS Southern Illinois University H. NIEDERREITER Southern Illinois University A WILEY-INTERSCIENCE PUBLICATION JOHN WILEY & SONS New York London Sydney Toronto Copyright © 1974, by John Wiley & Sons, Inc. All rights reserved. Published simultaneously in Canada. No part of this book may be reproduced by any means, nor transmitted, nor translated into a machine language with- out the written permission of the publisher. Library of Congress Cataloging in Publication Data: Kuipers, Lauwerens. Uniform distribution of sequences. (Pure and applied mathematics) "A Wiley-Interscience publication." Bibliography: 1. Sequences (Mathematics) 1. Niederreiter, H., joint author. II. Title. QA292.K84 515'.242 73-20497 ISBN 0-471-51045-9 Printed in the United States of America 10-987654321 To Francina and Gerlinde REFACCE The theory of uniform distribution modulo one (Gleichverteilung modulo Eins, equirepartition modulo un) is concerned, at least in its classical setting, with the distribution of fractional parts of real numbers in the unit interval (0, 1). The development of this theory started with Hermann Weyl's celebrated paper of 1916 titled: "Uber die Gleichverteilung von Zahlen mod. Eins." Weyl's work was primarily intended as a refinement of Kronecker's approxi- mation theorem, and, therefore, in its initial stage, the theory was deeply rooted in diophantine approximations. During the last decades the theory has unfolded beyond that framework. Today, the subject presents itself as a meeting ground for topics as diverse as number theory, probability theory, functional analysis, topological algebra, and so on.
    [Show full text]
  • Exponential Sums and Applications in Number Theory and Analysis
    Faculty of Sciences Department of Mathematics Exponential sums and applications in number theory and analysis Frederik Broucke Promotor: Prof. dr. J. Vindas Master's thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Mathematics Academic year 2017{2018 ii Voorwoord Het oorspronkelijke idee voor deze thesis was om het bewijs van het ternaire vermoeden van Goldbach van Helfgott [16] te bestuderen. Al snel werd mij duidelijk dat dit een monumentale opdracht zou zijn, gezien de omvang van het bewijs (ruim 300 bladzij- den). Daarom besloot ik om in de plaats de basisprincipes van de Hardy-Littlewood- of cirkelmethode te bestuderen, de techniek die de ruggengraat vormt van het bewijs van Helfgott, en die een zeer belangrijke plaats inneemt in de additieve getaltheorie in het algemeen. Hiervoor heb ik gedurende het eerste semester enkele hoofdstukken van het boek \The Hardy-Littlewood method" van R.C. Vaughan [37] gelezen. Dit is waarschijnlijk de moeilijkste wiskundige tekst die ik tot nu toe gelezen heb; de weinige tussenstappen, het gebrek aan details, en zinnen als \one easily sees that" waren vaak frustrerend en demotiverend. Toch heb ik doorgezet, en achteraf gezien ben ik echt wel blij dat ik dat gedaan heb. Niet alleen heb ik enorm veel bijgeleerd over het onderwerp, ik heb ook het gevoel dat ik beter of vlotter ben geworden in het lezen van (moeilijke) wiskundige teksten in het algemeen. Na het lezen van dit boek gaf mijn promotor, professor Vindas, me de opdracht om de idee¨en en technieken van de cirkelmethode toe te passen in de studie van de functie van Riemann, een \pathologische" continue functie die een heel onregelmatig puntsgewijs gedrag vertoont.
    [Show full text]
  • Estimating the Growth Rate of the Zeta-Function Using the Technique of Exponent Pairs
    Estimating the Growth Rate of the Zeta-function Using the Technique of Exponent Pairs Shreejit Bandyopadhyay July 1, 2014 Abstract The Riemann-zeta function is of prime interest, not only in number theory, but also in many other areas of mathematics. One of the greatest challenges in the study of the zeta function is the understanding of its behaviour in the critical strip 0 < Re(s) < 1, where s = σ+it is a complex number. In this note, we first obtain a crude bound for the growth of the zeta function in the critical strip directly from its approximate functional equation and then show how the estimation of its growth reduces to a problem of evaluating an exponential sum. We then apply the technique of exponent pairs to get a much improved bound on the growth rate of the zeta function in the critical strip. 1 Introduction The Riemann zeta function ζ(s) with s = σ+it a complex number can be defined P 1 Q 1 −1 in either of the two following ways - ζ(s) = n ns or ζ(s) = p(1− ps ) , where in the first expression we sum over all natural numbers while in the second, we take the product over all primes. That these two expressions are equivalent fol- lows directly from the expression of n as a product of primes and the fundamen- tal theorem of arithmetic. It's easy to check that both the Dirichlet series, i.e., the first sum and the infinite product converge uniformly in any finite region with σ > 1.
    [Show full text]
  • New Equidistribution Estimates of Zhang Type
    NEW EQUIDISTRIBUTION ESTIMATES OF ZHANG TYPE D.H.J. POLYMATH Abstract. We prove distribution estimates for primes in arithmetic progressions to large smooth squarefree moduli, with respect to congruence classes obeying Chinese 1 7 Remainder Theorem conditions, obtaining an exponent of distribution 2 ` 300 . Contents 1. Introduction 1 2. Preliminaries 8 3. Applying the Heath-Brown identity 14 4. One-dimensional exponential sums 23 5. Type I and Type II estimates 38 6. Trace functions and multidimensional exponential sum estimates 59 7. The Type III estimate 82 8. An improved Type I estimate 94 References 105 1. Introduction In May 2013, Y. Zhang [52] proved the existence of infinitely many pairs of primes with bounded gaps. In particular, he showed that there exists at least one h ¥ 2 such that the set tp prime | p ` h is primeu is infinite. (In fact, he showed this for some even h between 2 and 7 ˆ 107, although the precise value of h could not be extracted from his method.) Zhang's work started from the method of Goldston, Pintz and Yıldırım [23], who had earlier proved the bounded gap property, conditionally on distribution estimates arXiv:1402.0811v3 [math.NT] 3 Sep 2014 concerning primes in arithmetic progressions to large moduli, i.e., beyond the reach of the Bombieri{Vinogradov theorem. Based on work of Fouvry and Iwaniec [11, 12, 13, 14] and Bombieri, Friedlander and Iwaniec [3, 4, 5], distribution estimates going beyond the Bombieri{Vinogradov range for arithmetic functions such as the von Mangoldt function were already known. However, they involved restrictions concerning the residue classes which were incompatible with the method of Goldston, Pintz and Yıldırım.
    [Show full text]
  • Exponential Sums and the Distribution of Prime Numbers
    Exponential Sums and the Distribution of Prime Numbers Jori Merikoski HELSINGIN YLIOPISTO HELSINGFORS UNIVERSITET UNIVERSITY OF HELSINKI Tiedekunta/Osasto Fakultet/Sektion Faculty Laitos Institution Department Faculty of Science Department of Mathematics and Statistics Tekijä Författare Author Jori Merikoski Työn nimi Arbetets titel Title Exponential Sums and the Distribution of Prime Numbers Oppiaine Läroämne Subject Mathematics Työn laji Arbetets art Level Aika Datum Month and year Sivumäärä Sidoantal Number of pages Master's thesis February 2016 102 p. Tiivistelmä Referat Abstract We study growth estimates for the Riemann zeta function on the critical strip and their implications to the distribution of prime numbers. In particular, we use the growth estimates to prove the Hoheisel-Ingham Theorem, which gives an upper bound for the dierence between consecutive prime numbers. We also investigate the distribution of prime pairs, in connection which we oer original ideas. The Riemann zeta function is dened as s in the half-plane Re We extend ζ(s) := n∞=1 n− s > 1. it to a meromorphic function on the whole plane with a simple pole at s = 1, and show that it P satises the functional equation. We discuss two methods, van der Corput's and Vinogradov's, to give upper bounds for the growth of the zeta function on the critical strip 0 Re s 1. Both of ≤ ≤ these are based on the observation that ζ(s) is well approximated on the critical strip by a nite exponential sum T s T Van der Corput's method uses the Poisson n=1 n− = n=1 exp s log n .
    [Show full text]
  • On Certain Exponential and Character Sums
    On certain exponential and character sums Bryce Kerr A thesis in fulfilment of the requirements for the degree of Doctor of Philosophy School of Mathematics and Statistics Faculty of Science March 2017 On certain exponential and character sums Bryce Kerr A thesis in fulfilment of the requirements for the degree of Doctor of Philosophy School of Mathematics and Statistics Faculty of Science November 2016 Contents 1 Introduction1 1.1 Introduction....................................1 1.2 Illustration of Vinogradov's method......................2 1.3 Outline of Thesis.................................6 1.3.1 Rational Exponential Sums Over the Divisor Function........6 1.3.2 Character Sums Over Shifted Primes..................6 1.3.3 Mixed Character Sums..........................7 1.3.4 The Fourth Moment of Character Sums................7 1.4 Notation......................................7 1.5 Acknowledgement.................................8 2 Rational Exponential Sums over the Divisor Function 11 2.1 Introduction.................................... 11 2.1.1 Notation.................................. 12 2.2 Main Results................................... 13 2.3 Combinatorial Decomposition.......................... 13 2.4 Approximation of Preliminary Sums...................... 14 2.5 Dirichlet Series Involving the Divisor Function................ 19 2.6 Proof of Theorem 2.1............................... 24 2.7 Proof of Theorem 2.2............................... 27 2.8 Proof of Theorem 2.3............................... 29 2.9 Proof of Theorem 2.4............................... 30 3 Character Sums over Shifted Primes 33 3.1 Introduction.................................... 33 3.2 Main Result.................................... 34 3.3 Reduction to Bilinear Forms........................... 34 3.4 The P´olya-Vinogradov Bound.......................... 35 3.5 Burgess Bounds.................................. 35 3.5.1 The Case r = 2.............................. 36 3.5.2 The Case r = 3.............................. 40 3.6 Complete Sums.................................
    [Show full text]
  • Lectures on Exponential Sums by Stephan Baier, JNU
    Lectures on exponential sums by Stephan Baier, JNU 1. Lecture 1 - Introduction to exponential sums, Dirichlet divisor problem The main reference for these lecture notes is [4]. 1.1. Exponential sums. Throughout the sequel, we reserve the no- tation I for an interval (a; b], where a and b are integers, unless stated otherwise. Exponential sums are sums of the form X e(f(n)); n2I where we write e(z) := e2πiz; and f is a real-valued function, defined on the interval I = (a; b]. The function f is referred to as the amplitude function. Note that the summands e(f(n)) lie on the unit circle. In applications, f will have some "nice" properties such as to be differentiable, possibly several times, and to satisfy certain bounds on its derivatives. Under suitable P conditions, we can expect cancellations in the sum n2I e(f(n)). The object of the theory of exponential sums is to detect such cancellations, i.e. to bound the said sum non-trivially. By the triangle inequality, the trivial bound is X e(f(n)) jIj; n2I where jIj = b − a is the length of the interval I = (a; b]. Exponential sums play a key role in analytic number theory. Often, error terms can be written in terms of exponential sums. Important examples for applications of exponential sums are the Dirichlet divisor problem (estimates for the average order of the divisor function), the Gauss circle problem (counting lattice points enclosed by a circle) and the growth of the Riemann zeta function in the critical strip.
    [Show full text]
  • Fast Methods to Compute the Riemann Zeta Function 11
    FAST METHODS TO COMPUTE THE RIEMANN ZETA FUNCTION GHAITH AYESH HIARY Abstract. The Riemann zeta function on the critical line can be computed using a straightforward application of the Riemann-Siegel formula, Sch¨onhage's method, or Heath-Brown's method. The complexities of these methods have exponents 1/2, 3/8, and 1/3 respectively. In this article, three new fast and potentially practical methods to compute zeta are presented. One method is very simple. Its complexity has exponent 2/5. A second method relies on this author's algorithm to compute quadratic exponential sums. Its complexity has exponent 1/3. The third method, which is our main result, employs an algo- rithm developed here to compute cubic exponential sums with a small cubic coefficient. Its complexity has exponent 4/13 (approximately, 0.307). 1. Introduction The Riemann zeta function is defined by: 1 X 1 (1.1) ζ(s) := ; <(s) > 1 : ns n=1 It can be continued analytically to the entire complex plane except for a simple pole at s = 1. The values of ζ(1=2 + it) on finite intervals are of great interest to number theorists. For example, they are used in the numerical verification of the Riemann Hypothesis, and more recently, as numerical evidence for apparent connections between the zeta function and certain random matrix theory models. Such considerations have motivated searches for methods to numerically evaluate ζ(1=2+it) to within ± t−λ for any t > 1 and any fixed λ. Searches for such methods can also be motivated from a computational complexity perspective, for the zeta function is of fundamental importance in number theory, so one may simply ask: how fast can it be computed? In this article, new fast methods to numerically evaluate ζ(1=2 + it) to within ± t−λ for any t > 1 and any fixed λ are presented.
    [Show full text]
  • Exponential Sums with Multiplicative Coefficients Without the Ramanujan Conjecture
    Exponential sums with multiplicative coefficients without the Ramanujan conjecture Yujiao Jiang, Guangshi Lü, Zhiwei Wang To cite this version: Yujiao Jiang, Guangshi Lü, Zhiwei Wang. Exponential sums with multiplicative coefficients without the Ramanujan conjecture. Mathematische Annalen, Springer Verlag, 2021, 379 (1-2), pp.589-632. 10.1007/s00208-020-02108-z. hal-03283544 HAL Id: hal-03283544 https://hal.archives-ouvertes.fr/hal-03283544 Submitted on 11 Jul 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. EXPONENTIAL SUMS WITH MULTIPLICATIVE COEFFICIENTS WITHOUT THE RAMANUJAN CONJECTURE YUJIAO JIANG, GUANGSHI LÜ, AND ZHIWEI WANG Abstract. We study the exponential sum involving multiplicative function f under milder conditions on the range of f, which generalizes the work of Montgomery and Vaughan. As an application, we prove cancellation in the sum of additively twisted coefficients of automorphic L-function on GLm (m > 4), uniformly in the additive character. 1. Introduction Let M be the class of all complex valued multiplicative functions. For f 2 M , the exponential sum involving multiplicative function f is defined by X S(N; α) := f(n)e(nα); (1.1) n6N where e(t) = e2πit.
    [Show full text]
  • Exponential Sums with Multiplicative Coefficients
    EXPONENTIAL SUMS WITH MULTIPLICATIVE COEFFICIENTS Abstract. We show that if an exponential sum with multiplicative coefficients is large then the associated multiplicative function is \pretentious". This leads to applications in the circle method. 1. Introduction 1a. Exponential sums with multiplicative coefficients. Throughout f is a totally multiplicative function with jf(n)j ≤ 1 for all n. Diverse investigations in analytic number theory involve sums like X S(α; N) := f(n)e(nα) n≤N where e(t) = e2iπt. Typically one wants non-trivial upper bounds on jS(α; N)j, which is usually less tractable on the major arcs (when α is close to a rational with small denomi- nator) than on the minor arcs (that is, all other α 2 [0; 1]). Moreover one also often wants asymptotic estimates for S(α; N) on the major arcs, though hitherto this has only been achieved in certain special cases. Our main result is to give such an estimate for all such f (and we will explore several applications). First though we need to introduce a distance function D between two multiplicative functions f and g with jf(n)j; jg(n)j ≤ 1:1 X 1 − Re f(p)g(p) (f(n); g(n); x)2 := : Dm p p≤x p-m Suppose that x ≥ R and T ≥ 1 are given. Select a primitive character (mod r) with r ≤ R, and a real number t with jtj ≤ T for which D(f(n); (n)nit; x) is minimized (where D = D1). Define κ(m) = 0 unless m is an integer, in which case Y κ(m) := ((f(p)=pit)b − (p)(f(p)=pit)b−1): pbkm 1 This distance function is particularly useful since it satisfies the triangle inequality D(f1(n); g1(n); x)+ D(f2(n); g2(n); x) ≥ D((f1f2)(n); (g1g2)(n); x), (see Lemma 3.1 of [7], or the general discussion in [8]).
    [Show full text]
  • A Survey on Pure and Mixed Exponential Sums Modulo Prime Powers
    A SURVEY ON PURE AND MIXED EXPONENTIAL SUMS MODULO PRIME POWERS TODD COCHRANE AND ZHIYONG ZHENG 1. Introduction In this paper we give a survey of recent work by the authors and others on pure and mixed exponential sums of the type pm pm X X epm (f(x)); χ(g(x))epm (f(x)); x=1 x=1 m 2πix=pm where p is a prime power, epm (·) is the additive character epm (x) = e and χ is a multiplicative character (mod pm). The goals of this paper are threefold; first, to point out the similarity between exponential sums over finite fields and exponential sums over residue class rings (mod pm) with m ≥ 2; second, to show how mixed exponential sums can be reduced to pure exponential sums when m ≥ 2 and third, to make a thorough review of the formulae and upper bounds that are available for such sums. Included are some new observations and consequences of the methods we have developed as well as a number of open questions, some very deep and some readily accessible, inviting the reader to a further investigation of these sums. 2. Pure Exponential Sums We start with a discussion of pure exponential sums of the type q X (2.1) S(f; q) = eq(f(x)) x=1 2πif(x)=q where f(x) is a polynomial over Z, q is any positive integer and eq(f(x)) = e . These sums enjoy the multiplicative property k Y mi S(f; q) = S(λif; pi ) i=1 Qk mi Pk mi where q = i=1 pi and i=1 λiq=pi = 1, reducing their evaluation to the case of prime power moduli.
    [Show full text]