Uniformity of the Möbius function in F q [t]
|
|
- Marybeth Lawson
- 5 years ago
- Views:
Transcription
1 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 of the Möbius function JMM / 21
2 The Möbius randomness principle Recall { ( 1) k if n = p µ(n) = 1 p 2 p k is a product of k distinct primes, 0 if n is not squarefree. Thus the sequence {µ(n)} is 1, 1, 1, 0, 1, 1,.... Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
3 The Möbius randomness principle Recall { ( 1) k if n = p µ(n) = 1 p 2 p k is a product of k distinct primes, 0 if n is not squarefree. Thus the sequence {µ(n)} is 1, 1, 1, 0, 1, 1,.... The Möbius randomness principle states that µ is random-like, Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
4 The Möbius randomness principle Recall { ( 1) k if n = p µ(n) = 1 p 2 p k is a product of k distinct primes, 0 if n is not squarefree. Thus the sequence {µ(n)} is 1, 1, 1, 0, 1, 1,.... The Möbius randomness principle states that µ is random-like, i.e. for any bounded, simple or structured function F, we have N µ(n)f(n) = o(n). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
5 Examples: 1 If F(n) = 1, then PNT is equivalent to N is equivalent to for any ɛ > 0. N µ(n) = O ɛ ( N 1/2+ɛ) µ(n) = o(n) and RH Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
6 Examples: 1 If F(n) = 1, then PNT is equivalent to N is equivalent to for any ɛ > 0. N µ(n) = O ɛ ( N 1/2+ɛ) µ(n) = o(n) and RH 2 If F(n) is periodic with period q, then N µ(n)f(n) = o(n) is equivalent to PNT in arithmetic progressions. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
7 3 Sarnak s conjecture: If (X, T ) is a dynamical system (i.e. X is a compact metric space, T : X X is continuous) with topological entropy zero, then for any x X and f C(X), N µ(n)f (T n x) = o(n). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
8 3 Sarnak s conjecture: If (X, T ) is a dynamical system (i.e. X is a compact metric space, T : X X is continuous) with topological entropy zero, then for any x X and f C(X), N µ(n)f (T n x) = o(n). 4 (Kalai/Green 2011) If F can be computed by bounded depth circuits, then N µ(n)f (n) = o(n). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
9 3 Sarnak s conjecture: If (X, T ) is a dynamical system (i.e. X is a compact metric space, T : X X is continuous) with topological entropy zero, then for any x X and f C(X), N µ(n)f (T n x) = o(n). 4 (Kalai/Green 2011) If F can be computed by bounded depth circuits, then N µ(n)f (n) = o(n). 5 (Dartyge-Tenenbaum 2005) If s(n) is the sum of digits of n in base q, then for any α R/Z, Here e(x) = e 2πix. N µ(n)e(s(n)α) = o(n). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
10 Exponential sums Davenport (1937): for any A > 0, N µ(n)e(nα) A N log A N uniformly in α R/Z. The implied constant is ineffective. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
11 Exponential sums Davenport (1937): for any A > 0, N µ(n)e(nα) A N log A N uniformly in α R/Z. The implied constant is ineffective. Baker-Harman (1991), Montgomery-Vaughan (unpublished): Assuming GRH, we have N µ(n)e(nα) ɛ N 3/4+ɛ uniformly in α R/Z, for any ɛ > 0. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
12 Since 1 0 N µ(n)e(nα) we cannot do better than N 1/2. 2 N = µ(n) 2 N, Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
13 Since 1 0 N µ(n)e(nα) we cannot do better than N 1/2. 2 = N µ(n) 2 N, Green-Tao (2008, 2012): If F(n) is a nilsequence, then for any A > 0, N µ(n)f (n) A N log A N. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
14 Since 1 0 N µ(n)e(nα) we cannot do better than N 1/2. 2 = N µ(n) 2 N, Green-Tao (2008, 2012): If F(n) is a nilsequence, then for any A > 0, N µ(n)f (n) A N log A N. Nilsequences include F(n) = e ( αn 2 + βn ) and F(n) = e ( nα βn). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
15 Function field analogy Let F q be the finite field on q elements. F q [t] is similar to Z in many aspects (both are UFDs). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
16 Function field analogy Let F q be the finite field on q elements. F q [t] is similar to Z in many aspects (both are UFDs). For f F q [t], define ( 1) k if f = cp 1 P 2 P k, P i distinct monic irreducibles, µ(f ) = c F q, 0 if f is not squarefree. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
17 Function field analogy Let F q be the finite field on q elements. F q [t] is similar to Z in many aspects (both are UFDs). For f F q [t], define ( 1) k if f = cp 1 P 2 P k, P i distinct monic irreducibles, µ(f ) = c F q, 0 if f is not squarefree. RH is true in F q [t]: for n 2, deg f =n, f monic µ(f ) = 0. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
18 Function field analogy Let F q be the finite field on q elements. F q [t] is similar to Z in many aspects (both are UFDs). For f F q [t], define ( 1) k if f = cp 1 P 2 P k, P i distinct monic irreducibles, µ(f ) = c F q, 0 if f is not squarefree. RH is true in F q [t]: for n 2, deg f =n, f monic µ(f ) = 0. Furthermore, GRH is true in F q [t] (Weil 1948). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
19 The field of fractions F q (t) = {f /g : f, g F q [t], g 0} is the analog of Q. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
20 The field of fractions F q (t) = {f /g : f, g F q [t], g 0} is the analog of Q. Define f /g = q deg f deg g. The completion of F q (t) with respect to is (( )) { } 1 n F q = α = a i t i : n Z, a i F q for every i, t i= the set of formal Laurent series in 1 t. This is the analog of R. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
21 The field of fractions F q (t) = {f /g : f, g F q [t], g 0} is the analog of Q. Define f /g = q deg f deg g. The completion of F q (t) with respect to is (( )) { } 1 n F q = α = a i t i : n Z, a i F q for every i, t i= the set of formal Laurent series in 1 t. This is the analog of R. Define T = {α F q (( 1 t )) : α < 1}. This is the analog of R/Z. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
22 Fix e q : F q {z C : z = 1} to be an additive character of F q. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
23 Fix e q : F q {z C : z = 1} to be an additive character of F q. For α = n i= a it i F q (( 1 t )), define e(α) = e q (a 1 ). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
24 Fix e q : F q {z C : z = 1} to be an additive character of F q. For α = n i= a it i F q (( 1 t )), define e(α) = e q (a 1 ). Thus e : F q (( 1 t )) {z C : z = 1} is an additive character of F q (( 1 t )). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
25 Problems we want to solve Problem 1. Let k 1 and Φ(x) = α k x k + α k 1 x k α 1 x be a polynomial in F q (( 1 t ))[x]. Show that µ(f )e(φ(f )) = o(q n ) deg f <n uniformly in Φ of degree k. Better yet, (since we have GRH) obtain a bound O(q c k n ) for some constant c k < 1. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
26 Problems we want to solve Problem 1. Let k 1 and Φ(x) = α k x k + α k 1 x k α 1 x be a polynomial in F q (( 1 t ))[x]. Show that µ(f )e(φ(f )) = o(q n ) deg f <n uniformly in Φ of degree k. Better yet, (since we have GRH) obtain a bound O(q c k n ) for some constant c k < 1. There are differences between this and the integer case. In fact, when k p = char(f q ), even the Weyl sum deg f <n e(φ(f )) is not well understood, since the Weyl differencing process breaks down (k! = 0). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
27 Problem 2. Let k 1 and Q F q [x 0, x 1,..., x n 1 ] be a polynomial of degree k. Show that µ(f )e q (Q(f )) = o(q n ) deg f <n uniformly in Q of degree k. Here Q(f ) is Q evaluated at the coefficients of f. Better yet, (since we have GRH) obtain a bound O(q c k n ) for some constant c k < 1. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
28 Problem 2. Let k 1 and Q F q [x 0, x 1,..., x n 1 ] be a polynomial of degree k. Show that µ(f )e q (Q(f )) = o(q n ) deg f <n uniformly in Q of degree k. Here Q(f ) is Q evaluated at the coefficients of f. Better yet, (since we have GRH) obtain a bound O(q c k n ) for some constant c k < 1. Problem 2 is more general than Problem 1 since for any polynomial Φ(x), (Φ(f )) 1 is a polynomial in the coefficients of f (recall that e(α) = e q ((α) 1 )). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
29 The linear case When k = 1 then Problem 1 and Problem 2 are the same. This is because for any linear form l F q [x 0,..., x n 1 ], there is α T such that l(f ) = (αf ) 1 for any deg f < n. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
30 The linear case When k = 1 then Problem 1 and Problem 2 are the same. This is because for any linear form l F q [x 0,..., x n 1 ], there is α T such that l(f ) = (αf ) 1 for any deg f < n. Theorem For any ɛ > 0, we have uniformly in α T. deg f <n µ(f )e(αf ) ɛ,q q (3/4+ɛ)n Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
31 Recall Baker-Harman and Montgomery-Vaughan s bound in Z (under GRH) N µ(n)e(αn) N 3/4+ɛ. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
32 Recall Baker-Harman and Montgomery-Vaughan s bound in Z (under GRH) N µ(n)e(αn) N 3/4+ɛ. Porritt independently proved a similar result which gives the same exponent 3/4 + ɛ when q is sufficiently large in terms of ɛ. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
33 Recall Baker-Harman and Montgomery-Vaughan s bound in Z (under GRH) N µ(n)e(αn) N 3/4+ɛ. Porritt independently proved a similar result which gives the same exponent 3/4 + ɛ when q is sufficiently large in terms of ɛ. Our argument is different from the proof in Z in some respects. This is because the topologies of T and R/Z are different and there is no summation by parts in F q [t]. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
34 We use Hayes L-functions of arithmetically distributed relations, as opposed to Dirichlet L-functions. Let M be the set of monic polynomials in F q [t]. Define an equivalence relation f g (mod R l,q ) on M as follows f g (mod Q) and the first l + 1 coefficients of f and g are the same. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
35 We use Hayes L-functions of arithmetically distributed relations, as opposed to Dirichlet L-functions. Let M be the set of monic polynomials in F q [t]. Define an equivalence relation f g (mod R l,q ) on M as follows f g (mod Q) and the first l + 1 coefficients of f and g are the same. Then M/R l,q is a semigroup, G l,q := (M/R l,q ) is a group. If λ is a nontrivial character of G l,q, then L(s, λ) = f M λ(f ) f s satisfies GRH (Rhin 1972). (If l = 0 then λ is a Dirichlet character.) Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
36 Theorem Assuming a quantitative form of the bilinear Bogolyubov theorem and p > 2. Then for any A > 0 and quadratic polynomial Q in F q [x 0,..., x n 1 ], uniformly in Q. deg f <n µ(f )e(q(f )) q,a q n n A Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
37 The quadratic case Theorem There is a constant c < 1 such that µ(f )e(αf 2 + βf ) q q cn uniformly in α, β T. deg f <n Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
38 Ideas of proof The classical circle method deals with sums like deg f <n µ(f )e(αf ) or deg f <n µ(f )e(αf 2 + βf ). To estimate such sums we need to distinguish two cases. α is close to a rational with small denominator (α is in the major arcs): use our understanding of the distribution of irreducibles in congruence classes, i.e. L-functions. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
39 Ideas of proof The classical circle method deals with sums like deg f <n µ(f )e(αf ) or deg f <n µ(f )e(αf 2 + βf ). To estimate such sums we need to distinguish two cases. α is close to a rational with small denominator (α is in the major arcs): use our understanding of the distribution of irreducibles in congruence classes, i.e. L-functions. α is not in the major arcs (α is in the minor arcs): use Vaughan s identity to decompose the sum into Vinogradov s Type I/Type II sums. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
40 In the case of deg f <n µ(f )e q(φ(f )), where Φ(x) = x T Mx and M is a symmetric matrix, the major arcs and minor arcs correspond to low rank and high rank matrices M. This is because e q (x T Mx) qn rank(m)/2. x F q n Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
41 In the case of deg f <n µ(f )e q(φ(f )), where Φ(x) = x T Mx and M is a symmetric matrix, the major arcs and minor arcs correspond to low rank and high rank matrices M. This is because e q (x T Mx) qn rank(m)/2. x F q n The low rank can be easily reduced to the linear case. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
42 In the case of deg f <n µ(f )e q(φ(f )), where Φ(x) = x T Mx and M is a symmetric matrix, the major arcs and minor arcs correspond to low rank and high rank matrices M. This is because e q (x T Mx) qn rank(m)/2. x F q n The low rank can be easily reduced to the linear case. Suppose for a contradiction that deg f <n µ(f )e q(φ(f )) δq n. We want to show that rank(m) is small. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
43 After using Vaughan s identity, Vinogradov s Type I/Type II sums, Cauchy-Schwarz and some combinatorial reasoning, we find that for some n k n, the set of pairs P h := {(a, b) : deg a, deg b G k+1 G k+1 : rank M a,b h} is large (has size (δ/n) O(1) q 2k+2 ) for some h = O(log(n/δ)). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
44 After using Vaughan s identity, Vinogradov s Type I/Type II sums, Cauchy-Schwarz and some combinatorial reasoning, we find that for some n k n, the set of pairs P h := {(a, b) : deg a, deg b G k+1 G k+1 : rank M a,b h} is large (has size (δ/n) O(1) q 2k+2 ) for some h = O(log(n/δ)). Here G m = {f : deg f < m}, M a,b = L T a ML b + L T b ML a and L a is the matrix of the map G n k G n, f af. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
45 Problem: We know P h := {(a, b) : deg a, deg b G k+1 G k+1 : rank M a,b h} is large, where M a,b = L T a ML b + L T b ML a. Show that rank M is small. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
46 Problem: We know P h := {(a, b) : deg a, deg b G k+1 G k+1 : rank M a,b h} is large, where M a,b = L T a ML b + L T b ML a. Show that rank M is small. If (a, b), (a, b) P h, then (a a, b) P 2h since M a a,b = M a,b M a,b. Similarly for the second coordinate. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
47 Problem: We know P h := {(a, b) : deg a, deg b G k+1 G k+1 : rank M a,b h} is large, where M a,b = L T a ML b + L T b ML a. Show that rank M is small. If (a, b), (a, b) P h, then (a a, b) P 2h since M a a,b = M a,b M a,b. Similarly for the second coordinate. By repeatedly smoothing in each coordinate, we find that P 64h contains an interesting structure. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
48 Theorem (Bilinear Bogolyubov Theorem) If P h ηq 2(k+1), then there exist F p -subspaces W 1, W 2 of the F p -vector space G k+1 of codimension r 1, r 2 and F p -bilinear forms Q 1,..., Q r on W 1 W 2 such that P 64h {(x, y) W 1 W 2 Q 1 (x, y) = = Q r (x, y) = 0} and max(r, r 1, r 2 ) c(η). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
49 Theorem (Bilinear Bogolyubov Theorem) If P h ηq 2(k+1), then there exist F p -subspaces W 1, W 2 of the F p -vector space G k+1 of codimension r 1, r 2 and F p -bilinear forms Q 1,..., Q r on W 1 W 2 such that P 64h {(x, y) W 1 W 2 Q 1 (x, y) = = Q r (x, y) = 0} and max(r, r 1, r 2 ) c(η). Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
50 Theorem (Bilinear Bogolyubov Theorem) If P h ηq 2(k+1), then there exist F p -subspaces W 1, W 2 of the F p -vector space G k+1 of codimension r 1, r 2 and F p -bilinear forms Q 1,..., Q r on W 1 W 2 such that P 64h {(x, y) W 1 W 2 Q 1 (x, y) = = Q r (x, y) = 0} and max(r, r 1, r 2 ) c(η). A similar result was proved independently by Gowers-Milicevic. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
51 Theorem (Bilinear Bogolyubov Theorem) If P h ηq 2(k+1), then there exist F p -subspaces W 1, W 2 of the F p -vector space G k+1 of codimension r 1, r 2 and F p -bilinear forms Q 1,..., Q r on W 1 W 2 such that P 64h {(x, y) W 1 W 2 Q 1 (x, y) = = Q r (x, y) = 0} and max(r, r 1, r 2 ) c(η). A similar result was proved independently by Gowers-Milicevic. We can take c(η) = O(exp(exp(exp(log O(1) η 1 )))). This is too large to be useful. If we can take c(η) = log O(1) η 1 then in our application we can take δ = n A and this implies that M has small rank. Thái Hoàng Lê & Pierre-Yves Bienvenu Uniformity of the Möbius function JMM / 21
A 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 informationOn the digits of prime numbers
On the digits of prime numbers Joël RIVAT Institut de Mathématiques de Luminy, Université d Aix-Marseille, France. rivat@iml.univ-mrs.fr work in collaboration with Christian MAUDUIT (Marseille) 1 p is
More 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 informationMöbius Randomness and Dynamics
Möbius Randomness and Dynamics Peter Sarnak Mahler Lectures 2011 n 1, µ(n) = { ( 1) t if n = p 1 p 2 p t distinct, 0 if n has a square factor. 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1,.... Is this a random sequence?
More informationLes chiffres des nombres premiers. (Digits of prime numbers)
Les chiffres des nombres premiers (Digits of prime numbers) Joël RIVAT Institut de Mathématiques de Marseille, UMR 7373, Université d Aix-Marseille, France. joel.rivat@univ-amu.fr soutenu par le projet
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationErgodic aspects of modern dynamics. Prime numbers in two bases
Ergodic aspects of modern dynamics in honour of Mariusz Lemańczyk on his 60th birthday Bedlewo, 13 June 2018 Prime numbers in two bases Christian MAUDUIT Institut de Mathématiques de Marseille UMR 7373
More informationHorocycle Flow at Prime Times
Horocycle Flow at Prime Times Peter Sarnak Mahler Lectures 2011 Rotation of the Circle A very simple (but by no means trivial) dynamical system is the rotation (or more generally translation in a compact
More informationOn Gelfond s conjecture on the sum-of-digits function
On Gelfond s conjecture on the sum-of-digits function Joël RIVAT work in collaboration with Christian MAUDUIT Institut de Mathématiques de Luminy CNRS-UMR 6206, Aix-Marseille Université, France. rivat@iml.univ-mrs.fr
More informationExplicit formulas and symmetric function theory
and symmetric function theory Department of Mathematics University of Michigan Number Theory and Function Fields at the Crossroads University of Exeter January 206 Arithmetic functions on Z over short
More informationGeneralizing the Hardy-Littlewood Method for Primes
Generalizing the Hardy-Littlewood Method for Primes Ben Green (reporting on joint work with Terry Tao) Clay Institute/University of Cambridge August 20, 2006 Ben Green (Clay/Cambridge) Generalizing Hardy-Littlewood
More informationOn the low-lying zeros of elliptic curve L-functions
On the low-lying zeros of elliptic curve L-functions Joint Work with Stephan Baier Liangyi Zhao Nanyang Technological University Singapore The zeros of the Riemann zeta function The number of zeros ρ of
More informationOn primitive elements in finite fields of low characteristic
On primitive elements in finite fields of low characteristic Abhishek Bhowmick Thái Hoàng Lê September 16, 2014 Abstract We discuss the problem of constructing a small subset of a finite field containing
More informationTHE AUTOCORRELATION OF THE MÖBIUS FUNCTION AND CHOWLA S CONJECTURE FOR THE RATIONAL FUNCTION FIELD
The Quarterly Journal of Mathematics Advance Access published January 17, 2013 The Quarterly Journal of Mathematics Quart. J. Math. 00 (2013), 1 9; doi:10.1093/qmath/has047 THE AUTOCORRELATION OF THE MÖBIUS
More informationResults of modern sieve methods in prime number theory and more
Results of modern sieve methods in prime number theory and more Karin Halupczok (WWU Münster) EWM-Conference 2012, Universität Bielefeld, 12 November 2012 1 Basic ideas of sieve theory 2 Classical applications
More informationEQUIDISTRIBUTION OF POLYNOMIAL SEQUENCES IN FUNCTION FIELDS, WITH APPLICATIONS. 1. Introduction
EQUIDISTRIBUTION OF POLYNOMIAL SEQUENCES IN FUNCTION FIELDS, WITH APPLICATIONS Abstract. We prove a function field analog of Weyl s classical theorem on equidistribution of polynomial sequences. Our result
More informationOn sums of squares of primes
Under consideration for publication in ath. Proc. Camb. Phil. Soc. 1 On sums of squares of primes By GLYN HARAN Department of athematics, Royal Holloway University of London, Egham, Surrey TW 2 EX, U.K.
More 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 informationThe exceptional set in the polynomial Goldbach problem
May 3, 200 2:55 WSPC/INSTRCTION FILE gcremarks-ijnt International Journal of Number Theory c World Scientific Publishing Company The exceptional set in the polynomial Goldbach problem Paul Pollack Mathematics
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 informationLecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method. Daniel Goldston
Lecture 1: Small Prime Gaps: From the Riemann Zeta-Function and Pair Correlation to the Circle Method Daniel Goldston π(x): The number of primes x. The prime number theorem: π(x) x log x, as x. The average
More informationReal Analysis Prelim Questions Day 1 August 27, 2013
Real Analysis Prelim Questions Day 1 August 27, 2013 are 5 questions. TIME LIMIT: 3 hours Instructions: Measure and measurable refer to Lebesgue measure µ n on R n, and M(R n ) is the collection of measurable
More informationThe Möbius function is strongly orthogonal to nilsequences
Annals of Mathematics 175 (2012), 541 566 http://dx.doi.org/10.4007/annals.2012.175.2.3 The Möbius function is strongly orthogonal to nilsequences By Ben Green and Terence Tao Abstract We show that the
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 informationThe dichotomy between structure and randomness. International Congress of Mathematicians, Aug Terence Tao (UCLA)
The dichotomy between structure and randomness International Congress of Mathematicians, Aug 23 2006 Terence Tao (UCLA) 1 A basic problem that occurs in many areas of analysis, combinatorics, PDE, and
More informationAbstract. 2. We construct several transcendental numbers.
Abstract. We prove Liouville s Theorem for the order of approximation by rationals of real algebraic numbers. 2. We construct several transcendental numbers. 3. We define Poissonian Behaviour, and study
More informationA remark on a conjecture of Chowla
J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada
More informationThe ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.
The ternary May 2013 The ternary : what is it? What was known? Ternary Golbach conjecture (1742), or three-prime problem: Every odd number n 7 is the sum of three primes. (Binary Goldbach conjecture: every
More informationArithmetic functions in short intervals
Arithmetic functions in short intervals Brad Rodgers Department of Mathematics University of Michigan Analytic Number Theory and Arithmetic Session JMM Jan. 2017 Brad Rodgers UM Short intervals Jan. 2017
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 informationGauss and Riemann versus elementary mathematics
777-855 826-866 Gauss and Riemann versus elementary mathematics Problem at the 987 International Mathematical Olympiad: Given that the polynomial [ ] f (x) = x 2 + x + p yields primes for x =,, 2,...,
More informationA Smorgasbord of Applications of Fourier Analysis to Number Theory
A Smorgasbord of Applications of Fourier Analysis to Number Theory by Daniel Baczkowski Uniform Distribution modulo Definition. Let {x} denote the fractional part of a real number x. A sequence (u n R
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 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 informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More informationResolution of the Cap Set Problem: Progression Free Subsets of F n q are exponentially small
Resolution of the Cap Set Problem: Progression Free Subsets of F n q are exponentially small Jordan S. Ellenberg, Dion Gijswijt Presented by: Omri Ben-Eliezer Tel-Aviv University January 25, 2017 The Cap
More informationNORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY
ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion
More informationThree hours THE UNIVERSITY OF MANCHESTER. 31st May :00 17:00
Three hours MATH41112 THE UNIVERSITY OF MANCHESTER ERGODIC THEORY 31st May 2016 14:00 17:00 Answer FOUR of the FIVE questions. If more than four questions are attempted, then credit will be given for the
More informationPolynomials over UFD s
Polynomials over UFD s Let R be a UFD and let K be the field of fractions of R. Our goal is to compare arithmetic in the rings R[x] and K[x]. We introduce the following notion. Definition 1. A non-constant
More information1 Absolute values and discrete valuations
18.785 Number theory I Lecture #1 Fall 2015 09/10/2015 1 Absolute values and discrete valuations 1.1 Introduction At its core, number theory is the study of the ring Z and its fraction field Q. Many questions
More informationON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE
ON PRIMES IN QUADRATIC PROGRESSIONS & THE SATO-TATE CONJECTURE LIANGYI ZHAO INSTITUTIONEN FÖR MATEMATIK KUNGLIGA TEKNISKA HÖGSKOLAN (DEPT. OF MATH., ROYAL INST. OF OF TECH.) STOCKHOLM SWEDEN Dirichlet
More 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 informationAlgebraic Number Theory and Representation Theory
Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number
More informationGeneralising the Hardy Littlewood method for primes
Generalising the Hardy Littlewood method for primes Ben Green Abstract. The Hardy Littlewood method is a well-known technique in analytic number theory. Among its spectacular applications are Vinogradov
More informationEstimates for sums over primes
8 Estimates for sums over primes Let 8 Principles of the method S = n N fnλn If f is monotonic, then we can estimate S by using the Prime Number Theorem and integration by parts If f is multiplicative,
More informationarxiv:math/ v1 [math.nt] 10 Jan 2006
Generalising the Hardy-Littlewood method for primes arxiv:math/0601211v1 [math.nt] 10 Jan 2006 Ben Green Abstract. The Hardy-Littlewood method is a well-known technique in analytic number theory. Among
More informationGoldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai
Goldbach Conjecture: An invitation to Number Theory by R. Balasubramanian Institute of Mathematical Sciences, Chennai balu@imsc.res.in R. Balasubramanian (IMSc.) Goldbach Conjecture 1 / 22 Goldbach Conjecture:
More informationGREEN-TAO THEOREM IN FUNCTION FIELDS. 1. Introduction
GEEN-TAO THEOEM IN FUNCTION FIELDS Abstract. We adapt the proof of the Green-Tao theorem on arithmetic progressions in primes to the setting of polynomials over a finite fields, to show that for every
More informationSieve weight smoothings and moments
Sieve weight smoothings and moments Andrew Granville, with Dimitris Koukoulopoulos & James Maynard Université de Montréal & UCL Workshop in Number Theory and Function Fields Exeter, Friday, January 21,
More informationGOLDBACH S PROBLEMS ALEX RICE
GOLDBACH S PROBLEMS ALEX RICE Abstract. These are notes from the UGA Analysis and Arithmetic Combinatorics Learning Seminar from Fall 9, organized by John Doyle, eil Lyall, and Alex Rice. In these notes,
More informationNEIL LYALL A N. log log N
SÁRKÖZY S THEOREM NEIL LYALL. Introduction The purpose of this expository note is to give a self contained proof (modulo the Weyl ineuality) of the following result, due independently to Sárközy [5] and
More informationMASTERS EXAMINATION IN MATHEMATICS SOLUTIONS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION SPRING 010 SOLUTIONS Algebra A1. Let F be a finite field. Prove that F [x] contains infinitely many prime ideals. Solution: The ring F [x] of
More informationWeyl group multiple Dirichlet series
Weyl group multiple Dirichlet series Paul E. Gunnells UMass Amherst August 2010 Paul E. Gunnells (UMass Amherst) Weyl group multiple Dirichlet series August 2010 1 / 33 Basic problem Let Φ be an irreducible
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationROST S DEGREE FORMULA
ROST S DEGREE FORMULA ALEXANDER MERKURJEV Some parts of algebraic quadratic form theory and theory of simple algebras with involutions) can be translated into the language of algebraic geometry. Example
More informationBjorn Poonen. MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties. January 17, 2006
University of California at Berkeley MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional (organized by Jean-Louis Colliot-Thélène, Roger Heath-Brown, János Kollár,, Alice Silverberg,
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
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 informationSome problems in analytic number theory for polynomials over a finite field
Some problems in analytic number theory for polynomials over a finite field Zeev Rudnick Abstract. The lecture explores several problems of analytic number theory in the context of function fields over
More information(IV.C) UNITS IN QUADRATIC NUMBER RINGS
(IV.C) UNITS IN QUADRATIC NUMBER RINGS Let d Z be non-square, K = Q( d). (That is, d = e f with f squarefree, and K = Q( f ).) For α = a + b d K, N K (α) = α α = a b d Q. If d, take S := Z[ [ ] d] or Z
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More 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 informationpart 2: detecting smoothness part 3: the number-field sieve
Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness Integer factorization, part 3: the number-field sieve D. J. Bernstein Problem: Factor 611. The Q sieve forms
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 informationMATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,
MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1
More informationA combinatorial problem related to Mahler s measure
A combinatorial problem related to Mahler s measure W. Duke ABSTRACT. We give a generalization of a result of Myerson on the asymptotic behavior of norms of certain Gaussian periods. The proof exploits
More informationHypersurfaces and the Weil conjectures
Hypersurfaces and the Weil conjectures Anthony J Scholl University of Cambridge 13 January 2010 1 / 21 Number theory What do number theorists most like to do? (try to) solve Diophantine equations x n +
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 informationArithmetic Progressions Over Quadratic Fields
Arithmetic Progressions Over Quadratic Fields Alexander Diaz, Zachary Flores, Markus Vasquez July 2010 Abstract In 1640 Pierre De Fermat proposed to Bernard Frenicle de Bessy the problem of showing that
More informationMATH 310 Course Objectives
MATH 310 Course Objectives Upon successful completion of MATH 310, the student should be able to: Apply the addition, subtraction, multiplication, and division principles to solve counting problems. Apply
More informationJournal of Integer Sequences, Vol. 5 (2002), Article
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.3 INTEGER SEQUENCES AND PERIODIC POINTS G. Everest 1, A. J. van der Poorten 2, Y. Puri 1, and T. Ward 1 1 School of Mathematics,
More informationA survey on l 2 decoupling
A survey on l 2 decoupling Po-Lam Yung 1 The Chinese University of Hong Kong January 31, 2018 1 Research partially supported by HKRGC grant 14313716, and by CUHK direct grants 4053220, 4441563 Introduction
More informationBILINEAR FORMS WITH KLOOSTERMAN SUMS
BILINEAR FORMS WITH KLOOSTERMAN SUMS 1. Introduction For K an arithmetic function α = (α m ) 1, β = (β) 1 it is often useful to estimate bilinear forms of the shape B(K, α, β) = α m β n K(mn). m n complex
More informationOn rational approximation of algebraic functions. Julius Borcea. Rikard Bøgvad & Boris Shapiro
On rational approximation of algebraic functions http://arxiv.org/abs/math.ca/0409353 Julius Borcea joint work with Rikard Bøgvad & Boris Shapiro 1. Padé approximation: short overview 2. A scheme of rational
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationON RESTRICTED ARITHMETIC PROGRESSIONS OVER FINITE FIELDS
ON RESTRICTED ARITHMETIC PROGRESSIONS OVER FINITE FIELDS BRIAN COOK ÁKOS MAGYAR Abstract. Let A be a subset of F n p, the n-dimensional linear space over the prime field F p of size at least δn (N = p
More informationON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
More informationSection 8.3 Partial Fraction Decomposition
Section 8.6 Lecture Notes Page 1 of 10 Section 8.3 Partial Fraction Decomposition Partial fraction decomposition involves decomposing a rational function, or reversing the process of combining two or more
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 informationOn repdigits as product of consecutive Lucas numbers
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 5132, Online ISSN 2367 8275 Vol. 24, 2018, No. 3, 5 102 DOI: 10.7546/nntdm.2018.24.3.5-102 On repdigits as product of consecutive Lucas numbers
More informationLagrange s polynomial
Lagrange s polynomial Nguyen Trung Tuan November 16, 2016 Abstract In this article, I will use Lagrange polynomial to solve some problems from Mathematical Olympiads. Contents 1 Lagrange s interpolation
More informationElliptic curves and modularity
Elliptic curves and modularity For background and (most) proofs, we refer to [1]. 1 Weierstrass models Let K be any field. For any a 1, a 2, a 3, a 4, a 6 K consider the plane projective curve C given
More informationQuadratic reciprocity (after Weil) 1. Standard set-up and Poisson summation
(December 19, 010 Quadratic reciprocity (after Weil Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ I show that over global fields k (characteristic not the quadratic norm residue symbol
More informationMTH598A Report The Vinogradov Theorem
MTH598A Report The Vinogradov Theorem Anurag Sahay 11141/11917141 under the supervision of Dr. Somnath Jha Dept. of Mathematics and Statistics 4th November, 2015 Abstract The Goldbach conjecture is one
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationAny real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function.
Arithmetic Functions Any real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function. Examples: τ(n) = number of divisors of n; ϕ(n) = number of invertible
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationThe ABC Conjecture and its Consequences on Curves
The ABC Conjecture and its Consequences on Curves Sachi Hashimoto University of Michigan Fall 2014 1 Introduction 1.1 Pythagorean Triples We begin with a problem that most high school students have seen
More informationFebruary 1, 2005 INTRODUCTION TO p-adic NUMBERS. 1. p-adic Expansions
February 1, 2005 INTRODUCTION TO p-adic NUMBERS JASON PRESZLER 1. p-adic Expansions The study of p-adic numbers originated in the work of Kummer, but Hensel was the first to truly begin developing the
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationDABOUSSI S VERSION OF VINOGRADOV S BOUND FOR THE EXPONENTIAL SUM OVER PRIMES (slightly simplified) Notes by Tim Jameson
DABOUSSI S VERSION OF VINOGRADOV S BOUND FOR THE EXPONENTIAL SUM OVER PRIMES (slightly simplified) Notes by Tim Jameson (recalled on a busman s holiday in Oslo, 00) Vinogradov s method to estimate an eponential
More informationExpansions of quadratic maps in prime fields
Expansions of quadratic maps in prime fields Mei-Chu Chang Department of Mathematics University of California, Riverside mcc@math.ucr.edu Abstract Let f(x) = ax 2 +bx+c Z[x] be a quadratic polynomial with
More informationArithmetic Functions Evaluated at Factorials!
Arithmetic Functions Evaluated at Factorials! Dan Baczkowski (joint work with M. Filaseta, F. Luca, and O. Trifonov) (F. Luca) Fix r Q, there are a finite number of positive integers n and m for which
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationPolynomial and Inverse Forms
Contemporary Mathematics Polynomial and Inverse Forms D. S. Passman Abstract. In a recent paper, this author studied invariant ideals in abelian group algebras under the action of certain infinite, locally
More informationCYCLOTOMIC POLYNOMIALS
CYCLOTOMIC POLYNOMIALS 1. The Derivative and Repeated Factors The usual definition of derivative in calculus involves the nonalgebraic notion of limit that requires a field such as R or C (or others) where
More informationProblem 1A. Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1. (Hint: 1. Solution: The volume is 1. Problem 2A.
Problem 1A Find the volume of the solid given by x 2 + z 2 1, y 2 + z 2 1 (Hint: 1 1 (something)dz) Solution: The volume is 1 1 4xydz where x = y = 1 z 2 This integral has value 16/3 Problem 2A Let f(x)
More informationDIFFERENCE SETS AND THE IRREDUCIBLES IN FUNCTION FIELDS. 1. Introduction
DIFFERENCE SETS AND THE IRREDUCIBLES IN FUNCTION FIELDS Abstract. Let A be a subset of the polnomials of degree less than N over a finite field F q. Let r be an non-zero element of F q. We show that if
More informationORAL QUALIFYING EXAM QUESTIONS. 1. Algebra
ORAL QUALIFYING EXAM QUESTIONS JOHN VOIGHT Below are some questions that I have asked on oral qualifying exams (starting in fall 2015). 1.1. Core questions. 1. Algebra (1) Let R be a noetherian (commutative)
More information