DOCSLIB.ORG

The Quintic Gauss Sums

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Quintic Gauss Sums 1 THE QUINTIC GAUSS SUMS Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaflichen Fakult¨aten der Georg-August Universit¨at zu Goettingen vorgelegt von L´eopold Fossi Talom Aus Bandjoun/ Yom V, Kamerun G¨ottingen 2002 D7 Referent: Prof. S.J. Patterson Korreferentin: Frau Prof. Dr. I. Kersten. Tag der Disputation: Contents List of Figures 7 Chapter 1. INTRODUCTION 9 Chapter 2. Generalities on Cyclotomic Fields 17 1. Introduction 17 2. Power residue Symbol 24 3. The primary choice of the prime factor in Q(ζ5) 26 Chapter 3. GAUSS SUMS 29 1. Gauss sums in number fields 29 2. Factorization of Gauss sums 36 3. Gauss sums over finite fields and the Davenport-Hasse relations 39 4. The Gauss sum and Jacobi sum as complex numbers 40 5. The moment Gauss sums and the uniform distribution 45 Chapter 4. CYCLOTOMIC CRYSTAL 49 1. Introduction 49 2. The cyclotomic case 51 3. The vertices 56 4. The geometry and the combinatoric of the fundamental domain for n = 3,5 59 5. Generalization 65 6. Cyclotomy revisited 69 Chapter 5. THE GAUSS SUMS AND THE FUNDAMENTAL DOMAIN 75 1. First identity 77 2. Second identity 79 3. Third identity 80 4. Cassels' formula 82 5. A generalized of a formula of Cassels' type 83 6. Conjectures on the partial sums of the Gauss sums 89 Chapter 6. APPENDIX 105 1. The Gauss periods or the Lagrange resolvents 105 2. The quadratic Gauss sums 109 3. Algorithm for the computation of the Gauss sums 111 4. data 115 Bibliography 143 5 List of Figures 1 Fundamental domain for n=3 and 3-faces for n=5 74 1 Graphic of the arguments of Gauss sums for π 1 (mod λ3) N(π) 20000 ≡ 84 ≤ 2 Graphic of the arguments of Gauss sums for π 1 (mod λ3) N(π) 40000 ≡ 85 ≤ 3 frequency in each 1 degree on the circle 86 4 frequency in each 1 degree on the circle 87 5 both graphs plotted one against another 87 6 g(X) = n≤X Ω(S0; "; π) log(N(π)) 93 0<X<40:000 1 7 g(X) = P6=5 n≤X Ω(S0; "; π) log(N(π)) 93 X 0<X<40:000 1 8 g(X) = P n≤X Ω(S0; "; π) log(N(π)) 94 X 0<X<40:000 1 N(π) 9 g(X) = X P n≤X Ω(S0; "; π) log(N(π))(1 X ) 94 0<X<40:000 − 1 10 g(X) = P n≤X Ω(S0; "; π) log(N(π)) and f(X) = X 0<X<40:000 1 N(π) X n≤X P Ω(S0; "; π) log(N(π))(1 X ) 95 0<X<40:000 − P 1 N(π) 11 g(X) = X n≤X Ω(S0; "; π) log(N(π)) 1 X 0<X<40:000 − N(π) and n≤PX Ω(S0; "; π) log(N(π)) 1 X 95 0<X<40:000 − 1=2 1=2 12 f(X)P= X− n≤X; µ(n)n 97 0<X<50:000 1 1=2 13 f(X) = Pn≤X; µ(n)n 97 X 0<X<50:000 14 π≡1 (mod Pλ3); g(1; "; π) log(N(π)) N(π)≤X;X≤40000 N(π) Pand π≡1 (mod λ3); g(1; "; π) log(N(π))(1 X ) 99 N(π)≤X;X≤40000 − 1 P 3 15 X6=5 π≡1 (mod λ ); g(1; "; π) log(N(π)) N(π)≤X;X≤40000 6 N(π) 5 andPX− π≡1 (mod λ3); g(1; "; π) log(N(π))(1 X ) 100 N(π)≤X;X≤40000 − P g(1,ε,π) log(N(π)) 16 π≡1 (mod λ3); N(π) 100 N(π)≤X;X≤40000 17 P 6 g(1; "; π) log(N(π)) f(X) = X− 5 Ω(S0; "; π) π≡1 (mod λ3); N(π)≤X;X≤40000 7 8 LIST OF FIGURES 6 g(1; "; π) log(N(π)) N(π) and X− 5 1 Ω(S0; "; π) − X π≡1 (mod λ3); N(π)≤X;X≤40000 101 g(1,ε,π) log(N(π)) 18 π≡1 (mod λ3); 102 Ω(S0,ε,π)N(π) N(π)≤X;X≤40000 19 P 6 g(1; "; π) log(N(π)) X− 5 and N(π) π≡1 (mod λ3); N(π)≤X;X≤40000 102 CHAPTER 1 INTRODUCTION In 1801, Gauss in his Disquisitiones Arithmeticae introduced the following sum k 1 − 2πimn2=k G2(m; k) = e : n=0 X where m and k are coprime. This sum has a remarkably simple dependence on its arguments. In the case k odd, it has values as pk; or ipk: Gauss discovered in 1801 that in fact for k odd: pk if k 1 mod 4 G2(1; k) = ≡ ipk if k 1 mod 4 ≡ − He only found a proof 4 years later, in August 1805. He also determined these values for k 0; 2 mod 4: There are nowadays many different proofs of this theorem. See for example≡ [S.I], [K.L], [E.T] One important property is that Gauss sums generate quadratic subfields of cyclo- tomic fields. Indeed one can verify easily that for integer k odd, 2 k−1 G (m; k) = ( 1) 2 k = k∗: 2 − k−1 2πi Therefore the quadratic field Q( (( 1) 2 k)) is contained in Q(e k ): This fact is − one of the properties discovered bqy Gauss before he determined the correct sign for the Gauss sums. He used it to prove the law of quadratic reciprocity. He considers : for two distinct primes p; q, and if ( : ) is the Legendre symbol, then the expression q 1 2 q−1 q−1 p∗ G (1; p) − G(q; p) 2 = p∗ 2 mod q 2 ≡ ≡ q thus (0.1) G (1; p)q G(q; p) (mod p) 2 ≡ q (0.2) G(1; p) (mod p) ≡ p p (0.3) ∗ G(1; p) (mod p) ≡ q q and so multiply both side of the last equation above by p we obtain the desired result: q p q−1 p−1 = ( 1)( 2 )( 2 ): p q − Another proof is obtained as follows. The Chinese Remainder Theorem give the values of Gauss sums for composite odd numbers pq and the definition of G2(1; p) 9 10 1. INTRODUCTION for different values of prime p is known for congruence classes modulo 4 of the odd numbers p, q, and pq so that in plugging in all that within the following identity: p q G (1; pq) = ( )( )G (1; p)G (1; q); 2 q p 2 2 we deduce the law of quadratic reciprocity as: p q p−1 q−1 ( )( ) = ( 1) 2 2 : q p − This is another proof of the law of quadratic reciprocity. A more general Gauss sum is the following. k 1 − (2πim`n=k) Gn(m; k) = e : X`=0 We see that for k prime and gcd(k; m) = 1 Gn(m; k) = τn(χ); χ:χ=1 X6 where the χ are all non trivial character modulo k of order ` and τn(χ) = χ(a) exp(2πian=k) a Xmod k The cubic Gauss sum, also called Kummer sum after E.E. Kummer, is p 1 − 2πin3 G (1; p) = exp( ) 3 p n=1 X can be expressed as G3 = τ3(χ) + τ3(χ) where χ is a cubic character on Fp, and p 1 − 2πin τ (χ) = χ(n) exp( ): 3 p n=1 X 3 The sum G3(1; p)is indeed a root of the cubic period polynomial fp(X) = X 3pX pL where 4p = L2 + 27M 2. This polynomial has exactly one root in eac−h − of the interval [ 2pp; pp], [ pp; pp] and [pp; 2pp], and the question here is to − − − know which of them contains the root G3. The quotient τ3(χ) τ (χ) j 3 j lies on the unit circle. Looking at their arguments θp, Kummer observed here that the investigation on the 45 cases of prime p less than 500 gives the frequency 3:2:1 respectively and he suggested that Whx x χh( θp ) = + o( ) h = 1; 2; 3; p≡1 mod 3; j j 2 log x log x Xp<x π where χ1 (resp. χ2; χ3) is the characteristic function of the interval (0; 3 ] (resp. π 2π π 1 1 1 ( 3 ; 3 ]; ( 3 ; π] and Wh = 2 ; 3 ; 6 for h = 1; 2; 3 respectively. The study of the frequence 1. INTRODUCTION 11 analysis of this arguments was done by Lehmer [EL], Goldstine and Von Neumann [G.VN]. They found, for p < 1000 a different distribution approximately 4 : 3 : 2. This led one to doubt about the conjecture of Kummer. The same investigation led one observed that the arguments θp are likely equidistributed in the interval (0; π) for the Lebesgue measure. Then following a suggestion of Davenport [Da], Moreno [MO] in 1974 proved that if I (0; π] is a subinterval, then 2 I x x χ (3θ ) = j j + o( ) I p 2 log x log x p 1 mod 3;p<x ≡ X where I is the Lebesgue measure of I. This just proves that the arguments of j j3 the τ3(χ) are uniformly distributed in the three intervals listed above. The idea of Moreno is that, the character χ = π is associated to a factor π p, such that : j π 1 mod 3 in the field of cubic roots of unity Q(ζ3).
Load more

Recommended publications
  • Classical Simulation of Quantum Circuits by Half Gauss Sums
    CLASSICAL SIMULATION OF QUANTUM CIRCUITS BY HALF GAUSS SUMS † ‡ KAIFENG BU ∗ AND DAX ENSHAN KOH ABSTRACT. We give an efficient algorithm to evaluate a certain class of expo- nential sums, namely the periodic, quadratic, multivariate half Gauss sums. We show that these exponential sums become #P-hard to compute when we omit either the periodic or quadratic condition. We apply our results about these exponential sums to the classical simulation of quantum circuits, and give an alternative proof of the Gottesman-Knill theorem. We also explore a connection between these exponential sums and the Holant framework. In particular, we generalize the existing definition of affine signatures to arbitrary dimensions, and use our results about half Gauss sums to show that the Holant problem for the set of affine signatures is tractable. CONTENTS 1. Introduction 1 2. Half Gausssums 5 3. m-qudit Clifford circuits 11 4. Hardness results and complexity dichotomy theorems 15 5. Tractable signature in Holant problem 18 6. Concluding remarks 20 Acknowledgments 20 Appendix A. Exponential sum terminology 20 Appendix B. Properties of Gauss sum 21 Appendix C. Half Gauss sum for ξd = ω2d with even d 21 Appendix D. Relationship between half− Gauss sums and zeros of a polynomial 22 References 23 arXiv:1812.00224v1 [quant-ph] 1 Dec 2018 1. INTRODUCTION Exponential sums have been extensively studied in number theory [1] and have a rich history that dates back to the time of Gauss [2]. They have found numerous (†) SCHOOL OF MATHEMATICAL SCIENCES, ZHEJIANG UNIVERSITY, HANGZHOU, ZHE- JIANG 310027, CHINA (*) DEPARTMENT OF PHYSICS, HARVARD UNIVERSITY, CAMBRIDGE, MASSACHUSETTS 02138, USA (‡) DEPARTMENT OF MATHEMATICS, MASSACHUSETTS INSTITUTE OF TECHNOLOGY, CAMBRIDGE, MASSACHUSETTS 02139, USA E-mail addresses: [email protected] (K.Bu), [email protected] (D.E.Koh).
    [Show full text]
  • Cubic and Biquadratic Reciprocity
    Rational (!) Cubic and Biquadratic Reciprocity Paul Pollack 2005 Ross Summer Mathematics Program It is ordinary rational arithmetic which attracts the ordinary man ... G.H. Hardy, An Introduction to the Theory of Numbers, Bulletin of the AMS 35, 1929 1 Quadratic Reciprocity Law (Gauss). If p and q are distinct odd primes, then q p 1 q 1 p = ( 1) −2 −2 . p − q We also have the supplementary laws: 1 (p 1)/2 − = ( 1) − , p − 2 (p2 1)/8 and = ( 1) − . p − These laws enable us to completely character- ize the primes p for which a given prime q is a square. Question: Can we characterize the primes p for which a given prime q is a cube? a fourth power? We will focus on cubes in this talk. 2 QR in Action: From the supplementary law we know that 2 is a square modulo an odd prime p if and only if p 1 (mod 8). ≡± Or take q = 11. We have 11 = p for p 1 p 11 ≡ (mod 4), and 11 = p for p 1 (mod 4). p − 11 6≡ So solve the system of congruences p 1 (mod 4), p (mod 11). ≡ ≡ OR p 1 (mod 4), p (mod 11). ≡− 6≡ Computing which nonzero elements mod p are squares and nonsquares, we find that 11 is a square modulo a prime p = 2, 11 if and only if 6 p 1, 5, 7, 9, 19, 25, 35, 37, 39, 43 (mod 44). ≡ q Observe that the p with p = 1 are exactly the primes in certain arithmetic progressions.
    [Show full text]
  • Appendices A. Quadratic Reciprocity Via Gauss Sums
    1 Appendices We collect some results that might be covered in a first course in algebraic number theory. A. Quadratic Reciprocity Via Gauss Sums A1. Introduction In this appendix, p is an odd prime unless otherwise specified. A quadratic equation 2 modulo p looks like ax + bx + c =0inFp. Multiplying by 4a, we have 2 2ax + b ≡ b2 − 4ac mod p Thus in studying quadratic equations mod p, it suffices to consider equations of the form x2 ≡ a mod p. If p|a we have the uninteresting equation x2 ≡ 0, hence x ≡ 0, mod p. Thus assume that p does not divide a. A2. Definition The Legendre symbol a χ(a)= p is given by 1ifa(p−1)/2 ≡ 1modp χ(a)= −1ifa(p−1)/2 ≡−1modp. If b = a(p−1)/2 then b2 = ap−1 ≡ 1modp,sob ≡±1modp and χ is well-defined. Thus χ(a) ≡ a(p−1)/2 mod p. A3. Theorem a The Legendre symbol ( p ) is 1 if and only if a is a quadratic residue (from now on abbre- viated QR) mod p. Proof.Ifa ≡ x2 mod p then a(p−1)/2 ≡ xp−1 ≡ 1modp. (Note that if p divides x then p divides a, a contradiction.) Conversely, suppose a(p−1)/2 ≡ 1modp.Ifg is a primitive root mod p, then a ≡ gr mod p for some r. Therefore a(p−1)/2 ≡ gr(p−1)/2 ≡ 1modp, so p − 1 divides r(p − 1)/2, hence r/2 is an integer. But then (gr/2)2 = gr ≡ a mod p, and a isaQRmodp.
    [Show full text]
  • Sums of Gauss, Jacobi, and Jacobsthai* One of the Primary
    JOURNAL OF NUMBER THEORY 11, 349-398 (1979) Sums of Gauss, Jacobi, and JacobsthaI* BRUCE C. BERNDT Department of Mathematics, University of Illinois, Urbana, Illinois 61801 AND RONALD J. EVANS Department of Mathematics, University of California at San Diego, L.a Jolla, California 92093 Received February 2, 1979 DEDICATED TO PROFESSOR S. CHOWLA ON THE OCCASION OF HIS 70TH BIRTHDAY 1. INTRODUCTION One of the primary motivations for this work is the desire to evaluate, for certain natural numbers k, the Gauss sum D-l G, = c e277inkl~, T&=0 wherep is a prime withp = 1 (mod k). The evaluation of G, was first achieved by Gauss. The sums Gk for k = 3,4, 5, and 6 have also been studied. It is known that G, is a root of a certain irreducible cubic polynomial. Except for a sign ambiguity, the value of G4 is known. See Hasse’s text [24, pp. 478-4941 for a detailed treatment of G, and G, , and a brief account of G, . For an account of G, , see a paper of E. Lehmer [29]. In Section 3, we shall determine G, (up to two sign ambiguities). Using our formula for G, , the second author [18] has recently evaluated G,, (up to four sign ambiguities). We shall also evaluate G, , G,, , and Gz4 in terms of G, . For completeness, we include in Sections 3.1 and 3.2 short proofs of known results on G, and G 4 ; these results will be used frequently in the sequel. (We do not discuss G, , since elaborate computations are involved, and G, is not needed in the sequel.) While evaluations of G, are of interest in number theory, they also have * This paper was originally accepted for publication in the Rocky Mountain Journal of Mathematics.
    [Show full text]
  • Reciprocity Laws Through Formal Groups
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 141, Number 5, May 2013, Pages 1591–1596 S 0002-9939(2012)11632-6 Article electronically published on November 8, 2012 RECIPROCITY LAWS THROUGH FORMAL GROUPS OLEG DEMCHENKO AND ALEXANDER GUREVICH (Communicated by Matthew A. Papanikolas) Abstract. A relation between formal groups and reciprocity laws is studied following the approach initiated by Honda. Let ξ denote an mth primitive root of unity. For a character χ of order m, we define two one-dimensional formal groups over Z[ξ] and prove the existence of an integral homomorphism between them with linear coefficient equal to the Gauss sum of χ. This allows us to deduce a reciprocity formula for the mth residue symbol which, in particular, implies the cubic reciprocity law. Introduction In the pioneering work [H2], Honda related the quadratic reciprocity law to an isomorphism between certain formal groups. More precisely, he showed that the multiplicative formal group twisted by the Gauss sum of a quadratic character is strongly isomorphic to a formal group corresponding to the L-series attached to this character (the so-called L-series of Hecke type). From this result, Honda deduced a reciprocity formula which implies the quadratic reciprocity law. Moreover he explained that the idea of this proof comes from the fact that the Gauss sum generates a quadratic extension of Q, and hence, the twist of the multiplicative formal group corresponds to the L-series of this quadratic extension (the so-called L-series of Artin type). Proving the existence of the strong isomorphism, Honda, in fact, shows that these two L-series coincide, which gives the reciprocity law.
    [Show full text]
  • Arxiv:0804.2233V4 [Math.NT]
    October 26, 2018 MEAN VALUES WITH CUBIC CHARACTERS STEPHAN BAIER AND MATTHEW P. YOUNG Abstract. We investigate various mean value problems involving order three primitive Dirichlet characters. In particular, we obtain an asymptotic formula for the first moment of central values of the Dirichlet L-functions associated to this family, with a power saving in the error term. We also obtain a large-sieve type result for order three (and six) Dirichlet characters. 1. Introduction and Main results Dirichlet characters of a given order appear naturally in many applications in number theory. The quadratic characters have seen a lot of attention due to attractive questions to ranks of elliptic curves, class numbers, etc., yet the cubic characters have been relatively neglected. In this article we are interested in mean values of L-functions twisted by characters of order three, and also large sieve-type inequalities for these characters. Our first result on such L-functions is the following Theorem 1.1. Let w : (0, ) R be a smooth, compactly supported function. Then ∞ → q (1) ∗ L( 1 , χ)w = cQw(0) + O(Q37/38+ε), 2 Q (q,3)=1 χ (mod q) X χX3=χ 0 b where c> 0 is a constant that can be given explicitly in terms of an Euler product (see (23) below), and w is the Fourier transform of w. Here the on the sum over χ restricts the sum ∗ to primitive characters, and χ0 denotes the principal character. This resultb is most similar (in terms of method of proof) to the main result of [L], who considered the analogous mean value but for the case of cubic Hecke L-functions on Q(ω), ω = e2πi/3.
    [Show full text]
  • Quadratic Reciprocity Via Linear Algebra
    QUADRATIC RECIPROCITY VIA LINEAR ALGEBRA M. RAM MURTY Abstract. We adapt a method of Schur to determine the sign in the quadratic Gauss sum and derive from this, the law of quadratic reciprocity. 1. Introduction Let p and q be odd primes, with p = q. We define the Legendre symbol (p/q) to be 1 if p is a square modulo q and 16 otherwise. The law of quadratic reciprocity, first proved by Gauss in 1801, states− that (p/q)(q/p) = ( 1)(p−1)(q−1)/4. − It reveals the amazing fact that the solvability of the congruence x2 p(mod q) is equivalent to the solvability of x2 q(mod p). ≡ There are many proofs of this law≡ in the literature. Gauss himself published five in his lifetime. But all of them hinge on properties of certain trigonometric sums, now called Gauss sums, and this usually requires substantial background on the part of the reader. We present below a proof, essentially due to Schur [2] that uses only basic notions from linear algebra. We say “essentially” because Schur’s goal was to deduce the sign in the quadratic Gauss sum by studying the matrix A = (ζrs) 0 r n 1, 0 s n 1 ≤ ≤ − ≤ ≤ − where ζ = e2πi/n. For the case of n = p a prime, Schur’s proof is reproduced in [1] and a ‘slicker’ proof was later supplied by Waterhouse [3]. Our point is to show that Schur’s proof can be modified to determine tr A when n is an odd number and this allows us to deduce the law of quadratic reciprocity.
    [Show full text]
  • The Fourth Moment of Dirichlet L-Functions
    Annals of Mathematics 173 (2011), 1{50 doi: 10.4007/annals.2011.173.1.1 The fourth moment of Dirichlet L-functions By Matthew P. Young Abstract We compute the fourth moment of Dirichlet L-functions at the central point for prime moduli, with a power savings in the error term. 1. Introduction Estimating moments of families of L-functions is a central problem in number theory due in large part to extensive applications. Yet, these moments are seen to be natural objects to study in their own right as they illuminate structure of the family and display beautiful symmetries. The Riemann zeta function has by far garnered the most attention from researchers. Ingham [Ing26] proved the asymptotic formula Z T 1 1 4 4 3 jζ( 2 + it)j dt = a4(log T ) + O((log T ) ) T 0 2 −1 where a4 = (2π ) . Heath-Brown [HB79] improved this result by obtaining Z T 4 1 1 4 X i − 1 +" (1.1) jζ( + it)j dt = a (log T ) + O(T 8 ) T 2 i 0 i=0 for certain explicitly computable constants ai (see (5.1.4) of [CFK+05]). Ob- taining a power savings in the error term was a significant challenge because it requires a difficult analysis of off-diagonal terms which contribute to the lower-order terms in the asymptotic formula. The fourth moment problem is related to the problem of estimating (1.2) X d(n)d(n + f) n≤x uniformly for f as large as possible with respect to x. Extensive discussion of this binary divisor problem can be found in [Mot94].
    [Show full text]
  • Arxiv:1512.06480V1 [Math.NT] 21 Dec 2015 N Definition
    CHARACTERIZATIONS OF QUADRATIC, CUBIC, AND QUARTIC RESIDUE MATRICES David S. Dummit, Evan P. Dummit, Hershy Kisilevsky Abstract. We construct a collection of matrices defined by quadratic residue symbols, termed “quadratic residue matrices”, associated to the splitting behavior of prime ideals in a composite of quadratic extensions of Q, and prove a simple criterion characterizing such matrices. We also study the analogous classes of matrices constructed from the cubic and quartic residue symbols for a set of prime ideals of Q(√ 3) and Q(i), respectively. − 1. Introduction Let n> 1 be an integer and p1, p2, ... , pn be a set of distinct odd primes. ∗ The possible splitting behavior of the pi in the composite of the quadratic extensions Q( pj ), where p∗ = ( 1)(p−1)/2p (a minimally tamely ramified multiquadratic extension, cf. [K-S]), is determinedp by the quadratic− residue symbols pi . Quadratic reciprocity imposes a relation on the splitting of p in Q( p∗) pj i j ∗ and pj in Q( pi ) and this leads to the definition of a “quadratic residue matrix”. The main purposep of this article isp to give a simple criterion that characterizes such matrices. These matrices seem to be natural elementary objects for study, but to the authors’ knowledge have not previously appeared in the literature. We then consider higher-degree variants of this question arising from cubic and quartic residue symbols for primes of Q(√ 3) and Q(i), respectively. − 2. Quadratic Residue Matrices We begin with two elementary definitions. Definition. A “sign matrix” is an n n matrix whose diagonal entries are all 0 and whose off-diagonal entries are all 1.
    [Show full text]
  • As an Entire Function; Gauss Sums We First Give, As Promised, the Anal
    Math 259: Introduction to Analytic Number Theory L(s; χ) as an entire function; Gauss sums We first give, as promised, the analytic proof of the nonvanishing of L(1; χ) for a Dirichlet character χ mod q; this will complete our proof of Dirichlet's theorem that there are infinitely primes in the arithmetic progression mq+a : m Z>0 whenever (a; q) = 1, and that the logarithmic density of suchf primes is 12='(q).g1 We follow [Serre 1973, Ch. VI 2]. Functions such as ζ(s), L(s; χ) and their products are special cases of whatx Serre calls \Dirichlet series": functions 1 f(s) := a e λns (1) X n − n=1 with an C and 0 λn < λn+1 . [For instance, L(s; χ) is of this form with 2 ≤ !1 λn = log n and an = χ(n).] We assume that the an are small enough that the sum in (1) converges for some s C. We are particularly interested in series such as 2 ζ (s) := L(s; χ) q Y χ mod q whose coefficients an are nonnegative. Then if (1) converges at some real σ0, it converges uniformly on σ σ0, and f(s) is analytic on σ > σ0. Thus a series (1) has a maximal open half-plane≥ of convergence (if we agree to regard C itself as an open half-plane for this purpose), namely σ > σ0 where σ0 is the infimum of the real parts of s C at which (1) converges. This σ0 is then called the \abscissa of convergence"2 2 of (1).
    [Show full text]
  • Sign Ambiguities of Gaussian Sums Heon Kim Louisiana State University and Agricultural and Mechanical College, [email protected]
    Louisiana State University LSU Digital Commons LSU Doctoral Dissertations Graduate School 2007 Sign Ambiguities of Gaussian Sums Heon Kim Louisiana State University and Agricultural and Mechanical College, [email protected] Follow this and additional works at: https://digitalcommons.lsu.edu/gradschool_dissertations Part of the Applied Mathematics Commons Recommended Citation Kim, Heon, "Sign Ambiguities of Gaussian Sums" (2007). LSU Doctoral Dissertations. 633. https://digitalcommons.lsu.edu/gradschool_dissertations/633 This Dissertation is brought to you for free and open access by the Graduate School at LSU Digital Commons. It has been accepted for inclusion in LSU Doctoral Dissertations by an authorized graduate school editor of LSU Digital Commons. For more information, please [email protected]. SIGN AMBIGUITIES OF GAUSSIAN SUMS A Dissertation Submitted to the Graduate Faculty of the Louisiana State University and Agricultural and Mechanical College in partial fulfillment of the requirements for the degree of Doctor of Philosophy in The Department of Mathematics by Heon Kim B.S. in Math., Chonbuk National University, 1995 M.S. in Math., Chonbuk National University, 1997 M.A. in Math., University of Georgia, 2002 December 2007 Acknowledgments This dissertation would not be possible without several contributions. The love of family and friends provided my inspiration and was my driving force. It has been a long journey and completing this work is definitely a high point in my academic career. I could not have come this far without the assistance of many individuals and I want to express my deepest appreciation to them. It is a pleasure to thank my dissertation advisor, Dr. Helena Verrill, and coad- visor Dr.
    [Show full text]
  • The Voronoi Formula and Double Dirichlet Series
    The Voronoi formula and double Dirichlet series Eren Mehmet Kıral and Fan Zhou May 10, 2016 Abstract We prove a Voronoi formula for coefficients of a large class of L-functions including Maass cusp forms, Rankin-Selberg convolutions, and certain non-cuspidal forms. Our proof is based on the functional equations of L-functions twisted by Dirichlet characters and does not directly depend on automorphy. Hence it has wider application than previous proofs. The key ingredient is the construction of a double Dirichlet series. MSC: 11F30 (Primary), 11F68, 11L05 Keywords: Voronoi formula, automorphic form, Maass form, multiple Dirichlet series, Gauss sum, Kloosterman sum, Rankin-Selberg L-function 1 Introduction A Voronoi formula is an identity involving Fourier coefficients of automorphic forms, with the coefficients twisted by additive characters on either side. A history of the Voronoi formula can be found in [MS04]. Since its introduction in [MS06], the Voronoi formula on GL(3) of Miller and Schmid has become a standard tool in the study of L-functions arising from GL(3), and has found important applications such as [BB], [BKY13], [Kha12], [Li09], [Li11], [LY12], [Mil06], [Mun13] and [Mun15]. As of yet the general GL(N) formula has had fewer applications, a notable one being [KR14]. The first proof of a Voronoi formula on GL(3) was found by Miller and Schmid in [MS06] using the theory of automorphic distributions. Later, a Voronoi formula was established for GL(N) with N ≥ 4 in [GL06], [GL08], and [MS11], with [MS11] being more general and earlier than [GL08] (see the addendum, loc.
    [Show full text]