BILINEAR FORMS WITH KLOOSTERMAN SUMS
|
|
- Dustin Lawson
- 5 years ago
- Views:
Transcription
1 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 coefficients, With applications to modular forms in mind, we restrict our attention to the situation in which K is a Kloosterman or hyper-kloosterman sum, i.e., for some k we have K = Kl k (, q) : (Z/qZ) C n q 1 k x 1,...,x k (Z/qZ) x 1...x k =n e q (x x k ) We can extend K to an arithmetic function by 0, or in other controlled ways. Since the prime q shall be somewhat large compared to the supports of α β, the precise nature of this extension does not affect our results. Our coefficients α shall be supported on [M] := {1,..., M}, while our coefficients β shall be supported on an interval N [1, q 1] of length N. Since K 1 (as a well-known consequence of Deligne s work), we can use Cauchy or Hölder to bound B(K, α, β) trivially, for instance, B(K, α, β) n α β (MN) 1/ (q 1/4 + M 1/ + N 1/ q 1/4 log q), an estimate that is nontrivial in the ranges M q δ, N q 1/+δ for some δ > 0, for instance. A fundamental challenge, when dealing with incomplete character sums, is to go beyond the Pòlya-Vinogradov range. )For Dirichlet Characters, Burgess bounds are the archetype [... ].) This was achieved in the present context by Kowalski, Michel, Sawin [?]. Theorem 1.1 ([?]). Let q be a prime, let M, N R satisfy Then for any ɛ > 0 we have 1 M Nq 1/4, q 1/4 < MN < q 5/4. B(K, α, β) n,ɛ q ɛ α β (MN) 1/ (M 1/ + (MN) 3/16 q 11/64 ). This is nontrivial when M = N q 11/4 + δ, for instance. We offer the following bound, which goes further beyond the Pòlya-Vinogradov range: 1
2 BILINEAR FORMS WITH KLOOSTERMAN SUMS Theorem 1.. Assume Then 1 M Nq, q 7/8 MN q 64. B(K, α, β) n,ɛ q ɛ α β (MN) 1/ (M 1/ + (q 7 (MN) 8 ) 1/7 ). This beats the trivial bound when M = N q δ, for instance. In applications, it is often beneficial to have specific bounds tailored to the scenario in which β = 1 N. This is the Type I scenario arising in the Vaughan [?] Heath-Brown [?] identities, the more general situation addressed in Theorem 1.1 is known as Type II. Kowalski, Michel, Sawin obtained the following Type I estimate: Theorem 1.3 ([?]). Assume α 1, that Then 1 M N, N < q, MN < q 3. ( B(K, α, 1 N ) q ɛ α 1/ 1 α 1/ M M 1/4 N 5 ) 1/1 N. q 3 Note that Cauchy gives α 1 M 1/ α, so a trivial bound is B(K, α, 1 N ) N α 1 α 1/ 1 α 1/ M 1/4 N. Theorem 1.3 beats this when M = N q 3/7+δ, for instance. Theorem 1.4. Assume that α 1 1 M N 3, MN q. Then ( B(K, α, 1 N ) q ɛ α /3 1 α 1/3 q M 1/6 4 ) 1/4 N. M 3 N 7 This defeats the trivial estimate as soon as M = N q /5+δ, say. B(K, α, 1 N ) N α 1 α /3 1 α 1/3 M 1/6 N.. Proof of Theorem 1.4 To prove Theorem 1.4, we begin as in [?, ] with the +ab-shifting trick. Given parameters A, B 1 such that we have B(K, α, N ) qɛ AB AB N, AM < q, s AM ν(r, s)µ(r, s) ν(r, s) =... (note the N here should be N, an interval of length N) µ(r, s) = η B K(s(r + b)). B<b B
3 BILINEAR FORMS WITH KLOOSTERMAN SUMS 3 For ν, we have the moment estimates ν 1 AN α 1 ν q ɛ AN α from [?]. Now we apply Hölder s inequality with exponent 6: s AM ν(r, s)µ(r, s) = νµ 1 ν /3 3/ ν 1/3 6 µ 6 (AN α 1 ) /3 (q ɛ AN α ) 1/6 µ 6 We adapt the stard notational convention that ɛ denotes an arbitrarily small positive number, whose value may differ between instances. After a small amount of bookkeeping, we now have (1) B(K, α, N ) qɛ AB (AN) 5 /3 6 α 1 α 1/3 µ 6. By the triangle inequality, we have Here K(x) = K(x). S(K, b, AM) = µ 6 6 b B S(K, b; AM) B = { b Z 6 : B < b i B, 1 i 6} i=1 K(s(r + b i ))K(s(r + b i+3 )). Definition.1. Let V be the affine variety of sextuples b = (b1,..., b 6 ) A 6 F q defined by the conditions (1) If k is even, then for any i {1,..., 6} the cardinality #{j : b j = b i } is even. () If k is odd not equal to 3, then {{b 1, b, b 3 }} = {{b 4, b 5, b 6 }} is an equality of multisets. (3) If k = 3, then either {{b 1, b, b 3 }} = {{b 4, b 5, b 6 }} or b = (b, b, b, b, b, b ) for some b, b. The role of the diagonal set is played by B = { b B : b mod q V }. Observe that the contribution from the vectors b B to µ 6 6 satisfies b B S(K, b; AM) qab 3 M := x 1.
4 4 BILINEAR FORMS WITH KLOOSTERMAN SUMS For b B, we can exploit averaging over r: Lemma.. For b B\B s F q, we have i=1 K(s(r + b i ))K(s(r + b i+3 )) q 1/. In particular, for any B B\B we have S(K, b, AM) AMq 1/ B. b B We refer to 3 for the proof. Generically we ll need to save more than q 1/. An application of the Plancherel formula this is the Pòlya-Vinogradov method from 4 of our course notes yields with S(K, b; AM) (log q) max λ mod q Ŝ(K, b, λ) Ŝ(K, b, λ) = s mod q R(K, r, λ, b) R(K, r, λ, b) = R(K, r, λ, b) = e q (λs) K(s(r + b i ))K(s(r + b i+3 )). i=1 By following the proof of [?, Theorem.3], we obtain the following generic estimate. Theorem.3. There exists a codimension one subvariety V bad A 6 F q containing V, with degree bounded independently of q, such that if λ F q b V bad (F q ) then Ŝ(K, b, λ) q therefore S(K, b, AM) q log q. This uses the full power of Deligne-Katz [?], but an improvement could still be sought on the codimension. Write B bad = { b B : b mod q V bad (F q )} B gen = B\B bad. By Schwartz-Zippel uniformity of the degree bound, we have #B bad (deg V bad )B 5 B 5. Thus by Lemma. we have b B bad \B S(K, b; AM) q 1/ AB 5 M := x. By Theorem.3 we have S(K, b; AM) (log q)qb 6 := (log q)x 3. Thus b B gen µ 6 6 (x 1 + x + x 3 ) log q x 1 = qab 3 M, x = q 1/ AB 5 M, x 3 = qb 6.
5 BILINEAR FORMS WITH KLOOSTERMAN SUMS 5 Choosing A = M 1/4 N 3/4, B = M 1/4 N 1/4 ensures that AB = N x 1 = x 3. We note that the hypotheses of our theorem ensure that A 1, AM < q as our parameters are acceptable. Moreover, the hypothesis M N q ensures that x x 3 = q(mn) 3/. Now from (1) we have B(K, α, N ) qɛ N (AN)5/6 α /3 1 α 1/3 q 1/6 (MN) 1/4 = qɛ+1/6 N N 5/6( N 15 ) /3 1/4 α M 5 1 α 1/3 (MN) 1/4 = q ɛ+1/6 M 1/4 N 17/4 α /3 1 α 1/3 = q ɛ M 1/6 N α /3 1 α 1/3 ( q 4 ) 1/4 M 3 N 7 We use a similar strategy to prove Theorem 1.. This time Cauchy-Scwhartz, the +ab-shifiting trick, Hölder-6 give Here S (K, b; AM) = B(K, α, β) α β (N + qɛ AB M /3 (AN) 5/6 µ 6 ), i=1 s,s AM s1 s mod q µ 6 6 = b B S (K, b; AM). K(s 1 (r+b i ))K(s (r+b i ))K(s 1 (r+b i+3 ))K(s (r+b i+3 )). In 3, we shall also confirm the following analogue of Lemma.: Lemma.4. For any subset B B\B we have S (K, b, AM) (AM) q 1/ B. b B For B, we have the trivial bound () S (K, b, AM) qa B 3 M := y 1 b B We WHAT the condition s 1 s mod q by the indicator function expression, 1 1 e q (λ(s 1 s )). q λ mod q The Pólya-Vinogradov method then gives S (K, b, AM) (log q) + (log q) max Ŝ(K, b, λ 1, λ ). λ 1 λ λ 1,λ mod q
6 6 BILINEAR FORMS WITH KLOOSTERMAN SUMS Here Ŝ(K, b, λ 1, λ ) = ζ(λ 1, λ, b) 1 q ζ(λ 1, λ, b) = λ mod q ζ(λ 1 + λ, λ + λ, b), R(r, λ 1, b)r(r, λ, b). Mimicking the proof of [KMS, Theorem.5] gives Theorem.5. There exists a codimension one subvariety V bad A 6 F q containing V, with degree bounded independently of q, such that for every b V bad (F q ) every distinct λ 1, λ F q, we have Ŝ(K, λ 1, λ, b) q 3/. In fact, V bad is the same in Theorem.3 Theorem.5. Using Lemma.4 for b B bad \B Theorem.5 for B gen () for B gives Choosing we have µ 6 6 (log q) (y 1 + y + y 3 ) y 1 = qa B 3 M, y = q 1/ A B 5 M, y 3 = q 3/ B 6. A = q 1/3 M /3 N 1/3, B = q 1/3 M /3 N /3, AB = N, y = y 3. Moreover, the hypothesis MN q 7/8 implies that y 1 y 3 = q 1/ M 4 N 4. Now Thus B(K, α, β) α β N + q ɛ( M /3 (AN) 5/6 ) 1/ ( M 4 N 4 ) 1/1 AB q 1/ = N + q ɛ 1/4 M 1/3 (qm N 4 ) 5/36 M 1/3 N 1/6 = N + q ɛ+7/7 M 7/18 N 7/18 = N + q ɛ (MN) 1/ (q 7 (MN) 8 ) 1/7. B(K, α, β) q ɛ α β (MN) 1/ (M 1/ + q 7 (MN) 8 ) 1/7. 3. Proof of lemmas Proof of Lemma.. We appeal directly to [?, Corollary 1.6]. The relevant vector is γ = (γ s,1,..., γ s,6 ), for i = 1,..., 6. γ s,i = ( ) s sbi, 0 1 Case 1: k even. If b B then there exists an i such that #{j : b j = b i } is odd.
7 BILINEAR FORMS WITH KLOOSTERMAN SUMS 7 Case : k > 3 odd. Here σ = (1, 1, 1, c, c, c), c denotes complex conjugation. If b B, then {{b 1, b, b }} {{b 4, b 5, b 6 }}. In particular, there exists an i such that #{j : b i = b j, j 3} #{j : b i = b j, j 4}. As known from [?, Remark 1.9], the special involution is ( ) 1 0 ξ =. 0 1 Since q s F q, we can never have ξγ i = γ j. The conditions () (3) of [?, Definition 1.3] are thus equivalent. Case 3: k = 3 This is almost the same as Case. The only thing that could go wrong is if β = (b, b, b, b, b, b ), but we have explicitly excluded this. Proof of Lemma.4. We have γ = (γ s1,1,..., γ s1,6, γ s,1,..., γ s,6 σ = (1, 1, 1, c, c, c, c, c, c, 1, 1, 1). Recall that s 1 s mod q. Case 1: k even. If b B then there exists an i such that #{j : b j = b i } is odd. Thus #{j 1 : γ j = γ i } is odd; here γ i = γ s1,i, since i < b. Case : k > 3 odd. If b B then #{j : b i = b j, j 3} #{j : b i = b j, j 4}, so there exists i 6 such that #{j 3 : b j = b i } #{j 4 : b j = b i }. note that γ j γ i for j > 6 (as s 1 s mod q). Since k > 3, this also means that the two expressions are incongruent modulo k. Also, k-normality of ( γ, σ) is the same with or without respect to the special involution ξ, since we can never have ξγ i = γ j. To see this, note that if ξγ i = γ j then q s i or q (s 1 + s ), for some i = 1,, both of which are impossible since q, s i F q, 4AM = 4(qMN) 1/3 q 64MN q the latter given by our hypothesis. Case 3: k = 3. Again this is basically the same as Case, since we ve explicitly forbidden vectors b of the shape (b, b, b, b b b ).
BILINEAR FORMS WITH KLOOSTERMAN SUMS AND APPLICATIONS. Contents
BILINEAR FORMS WITH KLOOSTERMAN SUMS AND APPLICATIONS EMMANUEL KOWALSKI, PHILIPPE MICHEL, AND WILL SAWIN Abstract. We prove non-trivial bounds for general bilinear forms in hyper-kloosterman sums when
More informationExplicit Bounds for the Burgess Inequality for Character Sums
Explicit Bounds for the Burgess Inequality for Character Sums INTEGERS, October 16, 2009 Dirichlet Characters Definition (Character) A character χ is a homomorphism from a finite abelian group G to C.
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 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 informationTHE 3-PART OF CLASS NUMBERS OF QUADRATIC FIELDS
Submitted exclusively to the London Mathematical Society DOI: 10.1112/S0000000000000000 THE 3-PART OF CLASS NUMBERS OF QUADRATIC FIELDS L. B. PIERCE Abstract We prove that the 3-part of the class number
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 informationDIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction
DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS INNA ZAKHAREVICH. Introduction It is a well-known fact that there are infinitely many rimes. However, it is less clear how the rimes are distributed
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 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 informationEstimates for character sums and Dirichlet L-functions to smooth moduli
arxiv:1503.07156v1 [math.nt] 4 Mar 015 Estimates for character sums and Dirichlet L-functions to smooth moduli A.J. Irving Centre de recherches mathématiques, Université de Montréal Abstract We use the
More informationHASSE-MINKOWSKI THEOREM
HASSE-MINKOWSKI THEOREM KIM, SUNGJIN 1. Introduction In rough terms, a local-global principle is a statement that asserts that a certain property is true globally if and only if it is true everywhere locally.
More information1 Adeles over Q. 1.1 Absolute values
1 Adeles over Q 1.1 Absolute values Definition 1.1.1 (Absolute value) An absolute value on a field F is a nonnegative real valued function on F which satisfies the conditions: (i) x = 0 if and only if
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 informationA NOTE ON CHARACTER SUMS IN FINITE FIELDS. 1. Introduction
A NOTE ON CHARACTER SUMS IN FINITE FIELDS ABHISHEK BHOWMICK, THÁI HOÀNG LÊ, AND YU-RU LIU Abstract. We prove a character sum estimate in F q[t] and answer a question of Shparlinski. Shparlinski [5] asks
More informationSolutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010.
Solutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010. (24) The p-adic numbers. Let p {2, 3, 5, 7, 11,... } be a prime number. (a) For x Q, define { 0 for x = 0, x p = p n for x = p n (a/b),
More informationSome applications of trace functions in analytic number theory
Some applications of trace functions in analytic number theory Ph. Michel, EPF Lausanne a pôt-pourri of joint works with E. Fouvry, E. Kowalski, Polymath8, V. Blomer, D. Milicevic, W.Sawin and others...
More informationROTH S THEOREM THE FOURIER ANALYTIC APPROACH NEIL LYALL
ROTH S THEOREM THE FOURIER AALYTIC APPROACH EIL LYALL Roth s Theorem. Let δ > 0 and ep ep(cδ ) for some absolute constant C. Then any A {0,,..., } of size A = δ necessarily contains a (non-trivial) arithmetic
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationMath 249B. Geometric Bruhat decomposition
Math 249B. Geometric Bruhat decomposition 1. Introduction Let (G, T ) be a split connected reductive group over a field k, and Φ = Φ(G, T ). Fix a positive system of roots Φ Φ, and let B be the unique
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationHECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS.
HECKE OPERATORS ON CERTAIN SUBSPACES OF INTEGRAL WEIGHT MODULAR FORMS. MATTHEW BOYLAN AND KENNY BROWN Abstract. Recent works of Garvan [2] and Y. Yang [7], [8] concern a certain family of half-integral
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 informationA numerically explicit Burgess inequality and an application to qua
A numerically explicit Burgess inequality and an application to quadratic non-residues Swarthmore College AMS Sectional Meeting Akron, OH October 21, 2012 Squares Consider the sequence Can it contain any
More informationPlaces of Number Fields and Function Fields MATH 681, Spring 2018
Places of Number Fields and Function Fields MATH 681, Spring 2018 From now on we will denote the field Z/pZ for a prime p more compactly by F p. More generally, for q a power of a prime p, F q will denote
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 informationGALOIS THEORY: LECTURE 20
GALOIS THEORY: LECTURE 0 LEO GOLDMAKHER. REVIEW: THE FUNDAMENTAL LEMMA We begin today s lecture by recalling the Fundamental Lemma introduced at the end of Lecture 9. This will come up in several places
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 informationVinogradov s mean value theorem and its associated restriction theory via efficient congruencing.
Vinogradov s mean value theorem and its associated restriction theory via efficient congruencing. Trevor D. Wooley University of Bristol Oxford, 29th September 2014 Oxford, 29th September 2014 1 / 1. Introduction
More informationU.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018
U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze
More informationThe Least Inert Prime in a Real Quadratic Field
Explicit Palmetto Number Theory Series December 4, 2010 Explicit An upperbound on the least inert prime in a real quadratic field An integer D is a fundamental discriminant if and only if either D is squarefree,
More informationGenerating Functions of Partitions
CHAPTER B Generating Functions of Partitions For a complex sequence {α n n 0,, 2, }, its generating function with a complex variable q is defined by A(q) : α n q n α n [q n ] A(q). When the sequence has
More informationMath 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums
Math 259: Introduction to Analytic Number Theory Exponential sums IV: The Davenport-Erdős and Burgess bounds on short character sums Finally, we consider upper bounds on exponential sum involving a character,
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 informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationThe Class Equation X = Gx. x X/G
The Class Equation 9-9-2012 If X is a G-set, X is partitioned by the G-orbits. So if X is finite, X = x X/G ( x X/G means you should take one representative x from each orbit, and sum over the set of representatives.
More informationSUMS OF VALUES OF A RATIONAL FUNCTION. x k i
SUMS OF VALUES OF A RATIONAL FUNCTION BJORN POONEN Abstract. Let K be a number field, and let f K(x) be a nonconstant rational function. We study the sets { n } f(x i ) : x i K {poles of f} and { n f(x
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 informationPretentiousness in analytic number theory. Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog
Pretentiousness in analytic number theory Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog The number of primes up to x Gauss, Christmas eve 1849: As a boy of 15 or 16, I
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 informationEXTENSION THEOREMS FOR THE FOURIER TRANSFORM ASSOCIATED WITH NON-DEGENERATE QUADRATIC SURFACES IN VECTOR SPACES OVER FINITE FIELDS
EXTENSION THEOREMS FOR THE FOURIER TRANSFORM ASSOCIATED WITH NON-DEGENERATE QUADRATIC SURFACES IN VECTOR SPACES OVER FINITE FIELDS ALEX IOSEVICH AND DOOWON KOH Abstract. We study the restriction of the
More informationNORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST
Problem A1. Let a 1, a 2,..., a n be n not necessarily distinct integers. exist a subset of these numbers whose sum is divisible by n. Prove that there - Answer: Consider the numbers s 1 = a 1, s 2 = a
More informationFIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS
FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS LINDSAY N. CHILDS Abstract. Let G = F q β be the semidirect product of the additive group of the field of q = p n elements and the cyclic
More informationSTRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER
STRINGS OF CONSECUTIVE PRIMES IN FUNCTION FIELDS NOAM TANNER Abstract In a recent paper, Thorne [5] proved the existence of arbitrarily long strings of consecutive primes in arithmetic progressions in
More informationLINNIK S THEOREM MATH 613E UBC
LINNIK S THEOREM MATH 63E UBC FINAL REPORT BY COLIN WEIR AND TOPIC PRESENTED BY NICK HARLAND Abstract This report will describe in detail the proof of Linnik s theorem regarding the least prime in an arithmetic
More informationBefore we prove this result, we first recall the construction ( of) Suppose that λ is an integer, and that k := λ+ 1 αβ
600 K. Bringmann, K. Ono Before we prove this result, we first recall the construction ( of) these forms. Suppose that λ is an integer, and that k := λ+ 1 αβ. For each A = Ɣ γ δ 0 (4),let j(a, z) := (
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationSome results on k-free numbers
Patrick Letendre 05 october 2013 Patrick Letendre Some results on k-free numbers 05 october 2013 1 / 17 A local point of view (1) Patrick Letendre Some results on k-free numbers 05 october 2013 2 / 17
More informationLocal Fields. Chapter Absolute Values and Discrete Valuations Definitions and Comments
Chapter 9 Local Fields The definition of global field varies in the literature, but all definitions include our primary source of examples, number fields. The other fields that are of interest in algebraic
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 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 informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More informationDickson Polynomials that are Involutions
Dickson Polynomials that are Involutions Pascale Charpin Sihem Mesnager Sumanta Sarkar May 6, 2015 Abstract Dickson polynomials which are permutations are interesting combinatorial objects and well studied.
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationMaximal Class Numbers of CM Number Fields
Maximal Class Numbers of CM Number Fields R. C. Daileda R. Krishnamoorthy A. Malyshev Abstract Fix a totally real number field F of degree at least 2. Under the assumptions of the generalized Riemann hypothesis
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 12, 2018 Outline 1 Non POMI Based s 2 Some Contradiction s 3
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 information#A28 INTEGERS 13 (2013) ADDITIVE ENERGY AND THE FALCONER DISTANCE PROBLEM IN FINITE FIELDS
#A28 INTEGERS 13 (2013) ADDITIVE ENERGY AND THE FALCONER DISTANCE PROBLEM IN FINITE FIELDS Doowon Koh Department of Mathematics, Chungbuk National University, Cheongju city, Chungbuk-Do, Korea koh131@chungbuk.ac.kr
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 informationMoreover this binary operation satisfies the following properties
Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................
More informationMaterial covered: Class numbers of quadratic fields, Valuations, Completions of fields.
ALGEBRAIC NUMBER THEORY LECTURE 6 NOTES Material covered: Class numbers of quadratic fields, Valuations, Completions of fields. 1. Ideal class groups of quadratic fields These are the ideal class groups
More informationMath 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid
Math 229: Introduction to Analytic Number Theory Elementary approaches I: Variations on a theme of Euclid Like much of mathematics, the history of the distribution of primes begins with Euclid: Theorem
More informationHarmonic analysis related to homogeneous varieties in three dimensional vector space over finite fields
Harmonic analysis related to homogeneous varieties in three dimensional vector space over finite fields Doowon Koh and Chun-Yen Shen Abstract. In this paper we study extension problems, averaging problems,
More informationANOTHER APPLICATION OF LINNIK S DISPERSION METHOD
ANOTHER APPLICATION OF LINNIK S DISPERSION METHOD ÉTIENNE FOUVRY AND MAKSYM RADZIWI L L In memoriam Professor Yu. V. Linnik 95-972 Abstract. Let α m and β n be two sequences of real numbers supported on
More information1 Randomized Computation
CS 6743 Lecture 17 1 Fall 2007 1 Randomized Computation Why is randomness useful? Imagine you have a stack of bank notes, with very few counterfeit ones. You want to choose a genuine bank note to pay at
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #7 09/26/2013
18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #7 09/26/2013 In Lecture 6 we proved (most of) Ostrowski s theorem for number fields, and we saw the product formula for absolute values on
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 informationOn the elliptic curve analogue of the sum-product problem
Finite Fields and Their Applications 14 (2008) 721 726 http://www.elsevier.com/locate/ffa On the elliptic curve analogue of the sum-product problem Igor Shparlinski Department of Computing, Macuarie University,
More informationElementary Properties of the Integers
Elementary Properties of the Integers 1 1. Basis Representation Theorem (Thm 1-3) 2. Euclid s Division Lemma (Thm 2-1) 3. Greatest Common Divisor 4. Properties of Prime Numbers 5. Fundamental Theorem of
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 informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationQuestion 1: Are there any non-anomalous eigenforms φ of weight different from 2 such that L χ (φ) = 0?
May 12, 2003 Anomalous eigenforms and the two-variable p-adic L-function (B Mazur) A p-ordinary p-adic modular (cuspidal) eigenform (for almost all Hecke operators T l with l p and for the Atkin-Lehner
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 informationGeneralized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv: v2 [math.
Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv:0801.0728v2 [math.co] 31 Mar 2008 David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, and Misha Rudnev
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationCS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves
CS264: Beyond Worst-Case Analysis Lecture #14: Smoothed Analysis of Pareto Curves Tim Roughgarden November 5, 2014 1 Pareto Curves and a Knapsack Algorithm Our next application of smoothed analysis is
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationRoth s Theorem on 3-term Arithmetic Progressions
Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic
More informationFINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures)
FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) Ana Zumalacárregui a.zumalacarregui@unsw.edu.au November 30, 2015 Contents 1 Operations on sets 1 2 Sum-product theorem
More informationMath 229: Introduction to Analytic Number Theory Čebyšev (and von Mangoldt and Stirling)
ath 9: Introduction to Analytic Number Theory Čebyšev (and von angoldt and Stirling) Before investigating ζ(s) and L(s, χ) as functions of a complex variable, we give another elementary approach to estimating
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationA bilinear Bogolyubov theorem, with applications
A bilinear Bogolyubov theorem, with applications Thái Hoàng Lê 1 & Pierre-Yves Bienvenu 2 1 University of Mississippi 2 Institut Camille Jordan November 11, 2018 Thái Hoàng Lê & Pierre-Yves Bienvenu A
More informationPrimes and Modular Arithmetic! CSCI 2824, Fall 2014!!
Primes and Modular Arithmetic! CSCI 2824, Fall 2014!!! Scheme version of the algorithm! for finding the GCD (define (gcd a b)! (if!(= b 0)!!!!a!!!!(gcd b (remainder a b))))!! gcd (812, 17) = gcd(17, 13)
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
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 informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
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 informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
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 informationA Simple Proof that ζ(n 2) is Irrational
A Simple Proof that ζ(n 2) is Irrational Timothy W. Jones February 3, 208 Abstract We prove that partial sums of ζ(n) = z n are not given by any single decimal in a number base given by a denominator of
More informationarxiv: v1 [math.nt] 24 Mar 2009
A NOTE ON THE FOURTH MOMENT OF DIRICHLET L-FUNCTIONS H. M. BUI AND D. R. HEATH-BROWN arxiv:93.48v [math.nt] 4 Mar 9 Abstract. We prove an asymptotic formula for the fourth power mean of Dirichlet L-functions
More informationMULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x +1 PROBLEM. 1. Introduction The 3x +1iteration is given by the function on the integers for x even 3x+1
MULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x + PROBLEM ANA CARAIANI Abstract. Recently Lagarias introduced the Wild semigroup, which is intimately connected to the 3x + Conjecture. Applegate and Lagarias
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 informationPolygonal Numbers, Primes and Ternary Quadratic Forms
Polygonal Numbers, Primes and Ternary Quadratic Forms Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun August 26, 2009 Modern number theory has
More information15 Dirichlet s unit theorem
18.785 Number theory I Fall 2017 Lecture #15 10/30/2017 15 Dirichlet s unit theorem Let K be a number field. The two main theorems of classical algebraic number theory are: The class group cl O K is finite.
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
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 information