Traces of high powers of the Frobenius class in the hyperelliptic ensemble
|
|
- Darcy Flynn
- 7 years ago
- Views:
Transcription
1 ACTA ARITHMETICA (2010) Traces of high powers of the Frobenius class in the hyperelliptic ensemble by Zeév Rudnick (Tel Aviv and Princeton, NJ) 1. Introduction. Fix a finite field F q of odd cardinality, and let C be a nonsingular projective curve defined over F q. For each extension field of degree n of F q, denote by N n (C) the number of points of C in F q n. The zeta function associated to C is defined as Z C (u) = exp n=1 N n (C) un n, u < 1 q, and is known to be a rational function of u of the form P C (u) (1.1) Z C (u) = (1 u)(1 qu) where P C (u) is a polynomial of degree 2g with integer coefficients, satisfying a functional equation ( ) 1 P C (u) = (qu 2 ) g P C. qu The Riemann Hypothesis, proved by Weil [19], is that the zeros of P (u) all lie on the circle u = 1/ q. Thus one may give a spectral interpretation of P C (u) as the characteristic polynomial of a 2g 2g unitary matrix Θ C : P C (u) = det(i u q Θ C ) so that the eigenvalues e iθ j of Θ C correspond to zeros q 1/2 e iθ j of Z C (u). The matrix (or rather the conjugacy class) Θ C is called the unitarized Frobenius class of C. We would like to study how the Frobenius classes Θ C change as we vary the curve over a family of hyperelliptic curves of genus g, in the limit of 2010 Mathematics Subject Classification: Primary 11G20. Key words and phrases: hyperelliptic curve, random matrix theory, zeros of L-functions, one-level density. DOI: /aa [81] c Instytut Matematyczny PAN, 2010
2 82 Z. Rudnick large genus and fixed constant field. The particular family H 2g+1 we choose is the family of all curves given in affine form by an equation C Q : y 2 = Q(x) where Q(x) = x 2g+1 + a 2g x 2g + + a 0 F q [x] is a square-free, monic polynomial of degree 2g + 1. The curve C Q is thus nonsingular and of genus g. We consider H 2g+1 as a probability space (ensemble) with the uniform probability measure, so that the expected value of any function F on H 2g+1 is defined as 1 F := F (Q). #H 2g+1 Q H 2g+1 Katz and Sarnak [11] showed that as q, the Frobenius classes Θ Q become equidistributed in the unitary symplectic group (in genus one this is due to Birch [2] for q prime, and to Deligne [3]). That is, for any continuous function on the space of conjugacy classes of, lim F (Θ Q) = q F (U) du. This implies that various statistics of the eigenvalues can, in this limit, be computed by integrating the corresponding quantities over. Our goal is to explore the opposite limit, that of fixed constant field and large genus (q fixed, g ; cf. [13, 6]). Since the matrices Θ Q now inhabit different spaces as g grows, it is not clear how to formulate an equidistribution problem. However, one can still meaningfully discuss various statistics, the most fundamental being various products of traces of powers of Θ Q, that is, r j=1 tr Θn j Q. Here we study the basic case of the expected values tr ΘQ n, where n is of order of the genus g. The mean value of traces of powers when averaged over the unitary symplectic group is easily seen [5] to be 2g, n = 0, (1.2) tr U n du = η n, 1 n 2g, 0, n > 2g, where { 1, n even, η n = 0, n odd.
3 Traces of high powers 83 We will show: Theorem 1. For all n > 0 we have η n, 0 < n < 2g, tr ΘQ n = 1 1/(q 1), n = 2g, 0, n > 2g + O q (nq n/2 2g + gq g ), 1 + η n q n/2 deg P (n/2) P prime deg P P + 1 the sum over all irreducible monic polynomials P, and where P := q deg P. In particular, we have Corollary 2. If 3 log q g < n < 4g 5 log q g but n 2g then ( ) 1 tr ΘQ n = tr U n du + o. g We do however get deviations from the Random Matrix Theory results (1.2) for small values of n, for instance tr ΘQ 2 tr U 2 du + 1 q + 1, and for n = 2g where we have tr Θ 2g Q tr U 2g du 1 q 1. Analogous results can be derived for mean values of products, e.g. for tr ΘQ m tr Θn Q, when m + n < 4g; see 6. To prove these results, we cannot use the powerful equidistribution theorem of Deligne [3], as was done for the fixed genus case in [11]. Rather, we use a variant of the analytic methods developed to deal with such problems in the number field setting [15, 10, 18]. Extending the range of our results to cover n > 4g is a challenge Application: The one-level density. The traces of powers determine all linear statistics, such as the number of angles θ j lying in a subinterval of R/2πZ, or the one-level density, a smooth linear statistic. To define the one-level density, we start with an even test function f, say in the Schwartz space S(R), and for any N 1 set F (θ) := k Z f ( N ( θ 2π k )),
4 84 Z. Rudnick which has period 2π and is localized in an interval of size 1/N in R/2πZ. For a unitary N N matrix U with eigenvalues e iθ j, j = 1,..., N, define N Z f (U) := F (θ j ), which counts the number of low-lying eigenphases θ j in the smooth interval of length 1/N around the origin defined by f. Katz and Sarnak [9] conjectured that for fixed q, the expected value of Z f over H 2g+1 will converge to Z f (U) du as g for any such test function f. Theorem 1 implies: Corollary 3. If f S(R) is even, with Fourier transform f supported in ( 2, 2), then Z f = Z f (U) du + dev(f) ( ) 1 + o g g where dev(f) = f(0) P prime j=1 deg P P 2 1 f(1) 1 q 1, the sum over all irreducible monic polynomials P. To show Corollary 3, one uses a Fourier expansion to see that (1.3) Z f (U) = f(x) dx + 1 ( ) n f tr U n. N N Averaging Z f (U) over the symplectic group, using (1.2), and assuming f is even, gives ( 1 ) Z f (U) du = f(0) 1 ( ) m f g g n 0 1 m g and then we use Theorem 1 to deduce Corollary 3. Corollary 3 is completely analogous to what is known in the number field setting for the corresponding case of zeta functions of quadratic fields, except for the lower order term which is different: While the coefficient of f(0) is as in the number field setting [14], the coefficient of f(1) is special to our function field setting. 2. Quadratic L-functions. In this section we give some known background on the zeta function of hyperelliptic curves. The theory was initiated by E. Artin [1]. We use Rosen [16] as a general reference. ( 1 ) Note that as g, Z f (U) du f(x) `1 sin 2πx 2πx dx.
5 Traces of high powers For a nonzero polynomial f F q [x], we define the norm f := q deg f. A prime polynomial is a monic irreducible polynomial. For a monic polynomial f, the von Mangoldt function Λ(f) is defined to be zero unless f = P k is a prime power in which case Λ(P k ) = deg P. The analogue of Riemann s zeta function is ζ q (s) := (1 P s ) 1, which is shown to equal P prime (2.1) ζ q (s) = 1 1 q 1 s. Let π q (n) be the number of prime polynomials of degree n. The Prime Polynomial Theorem in F q [x] asserts that π q (n) = qn n + O(qn/2 ), which follows from the identity (equivalent to (2.1)) (2.2) Λ(f) = q n, deg f=n the sum over all monic polynomials of degree n For a monic polynomial D F q [x] of positive degree which is not a perfect square, we define the quadratic character χ D in terms of the quadratic residue symbol for F q [x] by ( ) D χ D (f) = f and the corresponding L-function L(u, χ D ) := P (1 χ D (P )u deg P ) 1, u < 1 q, the product over all monic irreducible (prime) polynomials P. Expanding in additive form using unique factorization, we write with L(u, χ D ) = β 0 A D (β) := deg B=β B monic A D (β)u β χ D (B). If D is nonsquare of positive degree, then A D (β) = 0 for β deg D and hence the L-function is in fact a polynomial of degree at most deg D 1.
6 86 Z. Rudnick 2.3. To proceed further, assume that D is square-free (and monic of positive degree). Then L(u, χ D ) has a trivial zero at u = 1 if and only if deg D is even. Thus { 1, deg D even, L(u, χ D ) = (1 u) λ L (u, χ D ), λ = 0, deg D odd, where L (u, χ D ) is a polynomial of even degree 2δ = deg D 1 λ satisfying the functional equation ( ) 1 L (u, χ D ) = (qu 2 ) δ L qu, χ D. In fact, L (u, χ D ) is the Artin L-function associated to the unique nontrivial quadratic character of F q (x)( D(x)) (see [16, Propositions 17.7 and 14.6]). We write 2δ L (u, χ D ) = A D(β)u β, β=0 where A D (0) = 1, and the coefficients A D (β) satisfy (2.3) A D(β) = q β δ A D(2δ β). In particular, the leading coefficient is A D (2δ) = qδ For D monic, square-free, and of positive degree, the zeta function (1.1) of the hyperelliptic curve y 2 = D(x) is Z D (u) = L (u, χ D ) (1 u)(1 qu). The Riemann Hypothesis, proved by Weil [19], asserts that all zeros of Z C (u), hence of L (u, χ D ), lie on the circle u = 1/ q. Thus we may write for a unitary 2δ 2δ matrix Θ D. L (u, χ D ) = det(i u q Θ D ) 2.5. By taking a logarithmic derivative of the identity det(i u q Θ D ) = (1 u) λ P (1 χ D (P )u deg P ) 1, which comes from writing L (u, χ D ) = (1 u) λ L(u, χ D ), we find (2.4) tr ΘD n = λ q n/2 + 1 q n/2 Λ(f)χ D (f). deg f=n
7 Traces of high powers Assume now that B is monic, of positive degree and not a perfect square. Then we have a bound for the character sum over primes: ( ) (2.5) B deg B q n/2. P n deg P =n P prime This is deduced by writing B = DC 2 with D square-free, of positive degree, and then using the explicit formula (2.4) and the unitarity of Θ D (which is the Riemann Hypothesis). 3. The hyperelliptic ensemble H 2g Averaging over H 2g+1. We denote by H d the set of square-free monic polynomials of degree d in F q [x]. The cardinality of H d is { (1 1/q)q d, d 2, #H d = q, d = 1, as is seen by writing d 0 #H d q ds = f monic square-free and using (2.1). In particular, for g 1, #H 2g+1 = (q 1)q 2g. f s = ζ q(s) ζ q (2s) We consider H 2g+1 as a probability space (ensemble) with the uniform probability measure, so that the expected value of any function F on H 2g+1 is defined as 1 (3.1) F := F (Q). #H 2g+1 Q H 2g+1 We can pick out square-free polynomials by using the Möbius function µ of F q [x] (as is done over the integers) via { 1, Q square-free, µ(a) = 0, otherwise. A 2 Q Thus we may write expected values as 1 (3.2) F (Q) = (q 1)q 2g the sums over all monic A, B. 2α+β=2g+1 deg B=β deg A=α µ(a)f (A 2 B),
8 88 Z. Rudnick 3.2. Averaging quadratic characters. Suppose now that we are given a polynomial f F q [x] and apply (3.2) to the quadratic character χ Q (f) = ( Q) f. Then Hence where χ A 2 B(f) = χ Q (f) = ( B f )( ) A 2 { ( B ) = f, gcd(a, f) = 1, f 0, otherwise. 1 (q 1)q 2g σ(f; α) := 2α+β=2g+1 deg A=α gcd(a,f)=1 σ(f; α) µ(a). deg B=β ( ) B, f 3.3. A sum of Möbius values. Suppose P is a prime of degree n, and k 1 and α 0. Set σ n (α) := σ(p k ; α) = µ(a). deg A=α gcd(a,p k )=1 Since the conditions gcd(a, P k ) = 1 and gcd(a, P ) = 1 are equivalent for a prime P and any k 1, this quantity is independent of k; the notation anticipates that it depends only on the degree n of P, as is shown in: Lemma 4. (i) For n = 1, (ii) If n 2 then Proof. Since P is prime, σ n (α) = µ(a) deg A=α σ 1 (0) = 1, σ 1 (α) = 1 q for all α 1. 1, α = 0 mod n, σ n (α) = q, α = 1 mod n, 0, otherwise. deg A=α P A µ(a) = deg A=α µ(a) deg A 1 =α n µ(p A 1 ). Now µ(p A 1 ) 0 only when A 1 is coprime to P, in which case µ(p A 1 ) = µ(p )µ(a 1 ) = µ(a 1 ). Hence σ n (α) = µ(a) + µ(a 1 ), deg A=α deg A 1 =α n (P,A 1 )=1
9 that is, on using σ n (α) σ n (α n) = A monic Traces of high powers 89 deg A=α 1, α = 0, µ(a) = q, α = 1, 0, α 2, µ(a) A s = 1 ζ q (s) = 1 q1 s and (2.1). For n 2 we get (ii), while for n = 1 we find that σ 1 (0) = 1 and for α 1, giving (i). σ 1 (α) = σ 1 (α 1) = = σ 1 (1) = q, 3.4. The probability that P Q Lemma 5. Let P be a prime. Then χ Q (P 2 ) = P P O(q 2g ). Proof. Since P is prime, χ Q (P 2 ) = 1 unless P divides Q, that is, setting { 1, P f, ι P (f) := 0, P f, we have χ Q (P 2 ) = ι P (Q) and thus, by (3.2), χ Q (P 2 ) = ι P = 1 (q 1)q 2g deg A 2 B=2g+1 µ(a)ι P (A 2 B). Since P is prime, P A 2 B if and only if P A and P B. Hence χ Q (P 2 1 ) = (q 1)q 2g µ(a) 0 α g deg A=α, P A deg B=2g+1 2α, P B Writing m := deg P, we get { 1 if m > β, #{B : deg B = β, P B} = q β 1 1/ P if m β, and deg A=α, P A µ(a) = σ m (α) 1.
10 90 Z. Rudnick is computed in Lemma 4. Hence χ Q (P 2 1 ) = (q 1)q 2g σ m (α)q 2g+1 2α 0 α g { 1 1/ P, 0 α g (m 1)/2, 1, g (m 1)/2 < α g ( = 1 1 ) ( 1 ) σ m (α) P 1 1/q q 2α + O(q 2g ). α=0 Moreover, inserting the values of σ m (α) given by Lemma 4 gives σ m (α) q 2α = 1 1/q 1 1/ P 2 α=0 (this is valid for both m = 1 and m 2!) and hence ( χ Q (P 2 ) = 1 1 ) 1 1 1/q P 1 1/q 1 1/ P 2 + O(q 2g ) = P P O(q 2g ) as claimed. 4. Double character sums. We consider the double character sum S(β; n) := ( ) B. P deg P =n P prime deg B=β B monic We may express S(β; n) in terms of the coefficients A P (β) = deg B=β χ P (B) of the L-function L(u, χ P ) = β A P (β)u β : S(β; n) = ( 1) ((q 1)/2)βn A P (β), deg P =n which follows from the law of quadratic reciprocity [16]: If A, B are monic then (B ) ( ) A = ( 1) ((q 1)/2) deg A deg B = ( 1) ((q 1)/2) deg A deg B χ A (B). A B Since A P (β) = 0 for β deg P, we find: Lemma 6. For n β we have S(β; n) = 0.
11 (4.1) (4.2) (4.3) (4.4) 4.1. Duality Proposition 7. (i) If n is odd and 0 β n 1 then Traces of high powers 91 S(β; n) = q β (n 1)/2 S(n 1 β; n), S(n 1; n) = π q (n)q (n 1)/2. (ii) If n is even and 1 β n 2 then S(β; n) = q β n/2( n β 2 ) S(n 1 β; n) + (q 1) S(j; n), S(n 1; n) = π q (n)q (n 2)/2. Proof. Assume that n = deg P is odd. Then L(u, χ P ) = L (u, χ P ), and so the coefficients A P (β) = A P (β) coincide. Therefore the functional equation in the form (2.3) implies j=0 A P (β) = A P (n 1 β)q β (n 1)/2, n odd, 0 β n 1. Consequently, for n odd, In particular, S(β; n) = q β (n 1)/2 S(n 1 β; n), n odd, 0 β n 1. S(n 1; n) = q (n 1)/2 S(0, n) = q (n 1)/2 π q (n), n odd. Next, assume that n = deg P is even. Then L(u, χ P ) = (1 u)l (u, χ P ), which implies that the coefficients of L(u, χ P ) and L (u, χ P ) satisfy and A P (β) = A P (β) A P (β 1), β 1, (4.5) A P (β) = A P (β) + A P (β 1) + + A P (0). Moreover, In particular, since (see (2.3)), we get so that A P (0) = A P (0), A P (n 1) = A P (n 2). A P (0) = 1, A P (n 2) = q (n 2)/2 A P (n 1) = A P (n 2) = q (n 2)/2, S(n 1; n) = π q (n)q (n 2)/2, The functional equation (2.3) implies n even. n even, A P (β) = A P (n 2 β)q β (n 2)/2, 0 β n 2,
12 92 Z. Rudnick and hence, for 1 β n 2, A P (β) = A P (β) A P (β 1) and inserting (4.5) gives = A P (n 2 β)q β (n 2)/2 A P (n 1 β)q β n/2 A P (β) = q β n/2( n β 2 ) A P (n 1 β) + (q 1) A P (j). Summing over all primes P of degree n gives as claimed. j=0 S(β; n) = q β n/2( n β 2 ) S(n 1 β; n) + (q 1) S(j; n) 4.2. An estimate for S(β; n) Lemma 8. Suppose β < n. Then ( β (4.6) S(β; n) = η β π q (n)q β/2 + O where η β = 1 for β even, and η β = 0 for β odd. Proof. We write S(β; n) = B= deg P =n deg B=β ( ) B + P B n qn/2+β j=0 ), deg P =n deg B=β ( ) B, P where the squares only occur when β is even. For B not a perfect square, we use the Riemann Hypothesis for curves in the form (2.5): ( ) B deg B q n/2. P n deg P =n Hence summing over all nonsquare B of degree β, of which there are at most q β, gives ( ) B β P n qβ+n/2. B deg P =n deg B=β Assume now that β is even. For B = C 2, we find that P and B are coprime since deg C = β/2 < n = deg P, and hence ( ) ( B P = C 2 ) P = +1 and so the squares, of which there are q β/2, contribute π q (n)q β/2. This proves (4.6).
13 Traces of high powers 93 By using duality, (4.6) can be bootstrapped into an improved estimate when β is odd: Proposition 9. If β is odd and β < n then (4.7) S(β; n) = η n π q (n)q β n/2 + O(q n ). Proof. Assume n odd with β < n. Then by (4.1) for odd n, S(β; n) = q β (n 1)/2 S(n 1 β; n) and inserting (4.6) with β replaced by n 1 β (which is odd in this case) we get S(n 1 β; n) q n/2+n 1 β, hence S(β; n) q β (n 1)/2 q n/2+n 1 β q n as claimed. Assume n even, with β < n. Using (4.3) and the bound (4.6) gives S(β; n) = q β n/2( n β 2 ) S(n 1 β; n) + (q 1) S(j; n) = q β n/2( n β 2 η n 1 β π q (n)q (n 1 β)/2 + (q 1) η j π q (n)q j/2) n 1 β ) + O (q β n/2 j n qn/2+j. j=0 The remainder term is O(q n ). For the main term, we note that n 1 β = 2L is even since β is odd and n is even, and then we can write the sum as which is our claim. j=0 j=0 ( L 1 q β n/2 π q (n) q L + (q 1) q l) = q β n/2 π q (n), 5. Proof of Theorem 1. The explicit formula (2.4) says that for n > 0, tr ΘQ n = 1 q n/2 Λ(f)χ Q (f), l=0 deg f=n the sum over all monic prime powers. We will separately treat the contributions P n of primes, n of squares and H n of higher odd powers of primes: (5.1) tr Θ n Q = P n + n + H n.
14 94 Z. Rudnick 5.1. The contribution of squares. When n is even, we have a contribution to tr ΘQ n coming from squares of prime powers (for odd n this term does not appear), which give n = 1 q n/2 Λ(h)χ Q (h 2 ). deg h=n/2 Since χ Q (h 2 ) = 0 or 1, we clearly have n 0 and n 1 q n/2 Λ(h) = 1 deg h=n/2 by (2.2). Hence the contribution of squares is certainly bounded. Now for h = P k a prime power, (5.2) χ Q (h 2 ) = χ Q (P 2 1 ) = 1 P O(q 2g ) by Lemma 5. Thus, recalling that deg h=m Λ(h) = qm from (2.2), we deduce that the contribution of squares to the average is n = ( ) 1 (5.3) q n/2 (deg P ) P O(q 2g ) = q n/2 deg P (n/2) deg P (n/2) deg P P O(q 2g ). In particular, we find that the contribution of squares to the average is ( ) n n = 1 + O + O(q 2g ) q n/2 and thus if n 3 log q g we get ( )) 1 n = η n (1 + o. g 5.2. The contributions of primes. The contribution to tr ΘQ n of primes is P n = n q n/2 χ Q (P ). deg P =n Proposition 10. n (5.4) P n = (q 1)q 2g+n/2 β+2α=2g+1 α,β 0 σ n (α)s(β; n). Moreover, if n > g then n (5.5) P n = (S(2g + 1; n) qs(2g 1; n)). (q 1)q2g+n/2
15 Proof. Using (3.2) we have n P n = (q 1)q 2g+n/2 Traces of high powers 95 deg P =n n = (q 1)q 2g+n/2 β+2α=2g+1 α,β 0 β+2α=2g+1 α,β 0 σ n (α) σ n (α)s(β; n), deg B=β ( ) B P which gives (5.4). Now assume that n > g. Then σ n (α) 0 forces α = 0, 1 mod n by Lemma 4(ii) and together with α g < n we must have α = 0, 1. Hence in (5.4) the only nonzero terms are those with α = 0, 1, which gives (5.5) Bounding the contribution of primes. Assume first that n g. In (5.4), if S(β; n) 0 then β < n by Lemma 6. For those, we use the bound S(β; n) (β/n)q β+n/2 of Lemma 8 and hence (5.6) P n n q 2g+n/2 β<n β n qn/2+β nq n 2g gq g (since n g), which vanishes as g. For g < n < 2g, use (5.5), and note that S(2g ± 1; n) = 0 by Lemma 6. Hence P n = 0, g < n < 2g The case n = 2g. We have S(2g + 1; 2g) = 0 by Lemma 6, and S(2g 1; 2g) = π q (2g)q (2g 2)/2 by (4.4). Hence 2g P n = (S(2g + 1, 2g) qs(2g 1, 2g)) (q 1)q2g+g 2g = (q 1)q 2g+g qπ q(2g)q (2g 2)/2 = 1 q 1 + O(gq g ) The case 2g < n. Here we use (4.7) to find n P n = (S(2g + 1; n) qs(2g 1; n)) (q 1)q2g+n/2 n = (q 1)q 2g+n/2 ( η nπ q (n)q 2g+1 n/2 + qη n π q (n)q 2g 1 n/2 ) ( ) n + O qn q2g+n/2 = η n nπ q (n) q n + O(nq n/2 2g ) = η n (1 + O(gq g )) + O(nq n/2 2g ). The main term is asymptotic to η n, and the remainder is o(1/g) provided 2g < n < 4g 5 log q g.
16 96 Z. Rudnick 5.4. The contribution of higher prime powers. The contribution of odd powers of primes P d, d > 1 odd, deg P d = n, is H n = 1 q n/2 d n 3 d odd deg P =n/d Since χ Q (P d ) = χ Q (P ) for d odd, the average is 1 H n = (q 1)q 2g+n/2 d n 3 d odd 1 = (q 1)q 2g+n/2 d n 3 d odd n d n d n d χ Q(P d ). deg P =n/d 2α+β=2g+1 2α+β=2g+1 σ n/d (α) ( σ n/d (α)s β; n ). d deg B=β ( ) B P In order that S(β; n/d) 0 we need β < n/d. Thus using the bound S(β; n/d) q β+n/2d of (4.6) (recall that β 2g + 1 is odd here) gives H n 1 q 2g+n/2 n q 2g+n/2 d n 3 d odd d n 3 d odd n d β min(n/d,2g+1) q n/2d+min(2g,n/d). q n/2d+β Treating separately the cases n/3 < 2g and n/3 2g we see that we have in either case (5.7) H n gq 2g Conclusion of the proof. We saw that tr Θ n Q = P n + n + H n with the individual terms giving O(gq g ), 0 < n < 2g, P n = 1/(q 1) + O(gq g ), n = 2g, η n + O(nq n/2 2g ), 2g < n, 1 deg P n = η n + η n q n/2 P O(q 2g ), H n = O(gq 2g ). deg P (n/2)
17 Traces of high powers 97 Putting these together gives Theorem 1. In particular, η n, 3 log q g < n < 2g, ( ) 1 tr ΘQ n = 1 1/(q 1), n = 2g, + o. g 0, 2g < n < 4g 8 log q g 6. The product of two traces. Using the methods of this paper, one can also compute mean values of products of traces. For the product of two traces, the results can be stated as follows: Assume min(m, n) log g and m + n 4g 100 log q g. Then (i) If m = n then n + η n, n < g, (6.1) tr ΘQ n 2 n + η n + 1 q 1, n = g, n 1 + η n, g < n < 2g 50 log q g. (ii) If m < n then for generic values of (m, n) we have η m η n, m + n < 2g, (6.2) tr ΘQ m tr ΘQ n η m η n η m+n, n < 2g, m + n > 2g, η m+n, n > 2g, n m < 2g, 0, n m > 2g, while on exceptional lines we have (6.3) tr ΘQ m tr ΘQ n η m η n + 1 q 1, m + n = 2g, η m η n η m+n + η m 1 q 1, n = 2g, q q 1 η m+n, n m = 2g. The expected values for the symplectic group are (cf. [5, 4, 8, 12]): (i) If m = n then n + η n, 1 n g, (6.4) tr U n 2 du = n 1 + η n, g + 1 n 2g, 2g, n > 2g. (ii) If 1 m < n then η m η n, m + n 2g, (6.5) tr U m tr U n η m η n η m+n, m < n 2g, m + n > 2g, du = η m+n, n > 2g, n m 2g, 0, n m > 2g. Comparing (6.4), (6.5) with (6.2), (6.3) we find that if m = min(m, n) log q g and m + n < 4g 100 log q g then for generic values of (m, n), that
18 98 Z. Rudnick is, if n, m 2g and n ± m 2g, we have (6.6) tr ΘQ m tr ΘQ n tr U m tr U n du, while on the lines n, m = 2g, n ± m = 2g the difference between the averages over H 2g+1 and is bounded by tr ΘQ m tr ΘQ n tr U m tr U n du 1 + o(1), g. q 1 These results can be used to study the two-level density (cf. [17, 7]). Acknowledgments. We thank Pär Kurlberg and Nicolas Templier for their comments. This research was supported by the Israel Science Foundation (grant No. 925/06) and by the Oswald Veblen Fund at the Institute for Advanced Study, Princeton. References [1] E. Artin, Quadratische Körper im Gebiete der höheren Kongruenzen I, II, Math. Z. 19 (1924), [2] B. J. Birch, How the number of points of an elliptic curve over a fixed prime field varies, J. London Math. Soc. 43 (1968), [3] P. Deligne, La conjecture de Weil. II, Inst. Hautes Études Sci. Publ. Math. 52 (1980), [4] P. Diaconis and S. N. Evans, Linear functionals of eigenvalues of random matrices, Trans. Amer. Math. Soc. 353 (2001), [5] P. Diaconis and M. Shahshahani, On the eigenvalues of random matrices, Studies in Applied Probability, J. Appl. Probab. 31A (1994), [6] D. Faifman and Z. Rudnick, Statistics of the zeros of zeta functions in families of hyperelliptic curves over a finite field, preprint, 2008, arxiv: [7] P. Gao, n-level density of the low-lying zeros of quadratic Dirichlet L-functions, preprint, 2008, arxiv: v1. [8] C. P. Hughes and Z. Rudnick, Mock-Gaussian behaviour for linear statistics of classical compact groups, J. Phys. A 36 (2003), [9] N. M. Katz and P. Sarnak, Zeroes of zeta functions and symmetry, Bull. Amer. Math. Soc. (N.S.) 36 (1999), [10],, Appendix to [9], unpublished. [11],, Random Matrices, Frobenius Eigenvalues, and Monodromy, Amer. Math. Soc. Colloq. Publ. 45, Amer. Math. Soc., Providence, RI, [12] J. P. Keating and B. E. Odgers, Symmetry transitions in random matrix theory & L-functions, Comm. Math. Phys. 281 (2008), [13] P. Kurlberg and Z. Rudnick, The fluctuations in the number of points on a hyperelliptic curve over a finite field, J. Number Theory 129 (2009), [14] S. J. Miller, A symplectic test of the L-functions ratios conjecture, Int. Math. Res. Notices 2008, no. 3.
19 Traces of high powers 99 [15] A. E. Özlük and C. Snyder, Small zeros of quadratic L-functions, Bull. Austral. Math. Soc. 47 (1993), [16] M. Rosen, Number Theory in Function Fields, Grad. Texts in Math. 210, Springer, New York, [17] M. Rubinstein, Low-lying zeros of L-functions and random matrix theory, Duke Math. J. 109 (2001), [18] K. Soundararajan, Nonvanishing of quadratic Dirichlet L-functions at s = 1/2, Ann. of Math. (2) 152 (2000), [19] A. Weil, Sur les courbes algébriques et les variétés qui s en déduisent, Hermann, Paris, Zeév Rudnick Raymond and Beverly Sackler School of Mathematical Sciences Tel Aviv University Tel Aviv 69978, Israel rudnick@post.tau.ac.il School of Mathematics Institute for Advanced Study Princeton, NJ 08540, U.S.A. Received on and in revised form on (5995)
The sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr
More informationQUADRATIC RECIPROCITY IN CHARACTERISTIC 2
QUADRATIC RECIPROCITY IN CHARACTERISTIC 2 KEITH CONRAD 1. Introduction Let F be a finite field. When F has odd characteristic, the quadratic reciprocity law in F[T ] (see [4, Section 3.2.2] or [5]) lets
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationPrime numbers and prime polynomials. Paul Pollack Dartmouth College
Prime numbers and prime polynomials Paul Pollack Dartmouth College May 1, 2008 Analogies everywhere! Analogies in elementary number theory (continued fractions, quadratic reciprocity, Fermat s last theorem)
More informationStatistics of the Zeta zeros: Mesoscopic and macroscopic phenomena
Statistics of the Zeta zeros: Mesoscopic and macroscopic phenomena Department of Mathematics UCLA Fall 2012 he Riemann Zeta function Non-trivial zeros: those with real part in (0, 1). First few: 1 2 +
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationSign changes of Hecke eigenvalues of Siegel cusp forms of degree 2
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationAlex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory
More informationOn the largest prime factor of x 2 1
On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationThe cyclotomic polynomials
The cyclotomic polynomials Notes by G.J.O. Jameson 1. The definition and general results We use the notation e(t) = e 2πit. Note that e(n) = 1 for integers n, e(s + t) = e(s)e(t) for all s, t. e( 1 ) =
More informationMonogenic Fields and Power Bases Michael Decker 12/07/07
Monogenic Fields and Power Bases Michael Decker 12/07/07 1 Introduction Let K be a number field of degree k and O K its ring of integers Then considering O K as a Z-module, the nicest possible case is
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationShort Programs for functions on Curves
Short Programs for functions on Curves Victor S. Miller Exploratory Computer Science IBM, Thomas J. Watson Research Center Yorktown Heights, NY 10598 May 6, 1986 Abstract The problem of deducing a function
More informationFACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationPrimality - Factorization
Primality - Factorization Christophe Ritzenthaler November 9, 2009 1 Prime and factorization Definition 1.1. An integer p > 1 is called a prime number (nombre premier) if it has only 1 and p as divisors.
More informationLOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO
LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationIrreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients
DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca
More informationInteger Sequences and Matrices Over Finite Fields
Integer Sequences and Matrices Over Finite Fields arxiv:math/0606056v [mathco] 2 Jun 2006 Kent E Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpolyedu
More informationARBITRAGE-FREE OPTION PRICING MODELS. Denis Bell. University of North Florida
ARBITRAGE-FREE OPTION PRICING MODELS Denis Bell University of North Florida Modelling Stock Prices Example American Express In mathematical finance, it is customary to model a stock price by an (Ito) stochatic
More informationOn the number-theoretic functions ν(n) and Ω(n)
ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationCounting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationOSTROWSKI FOR NUMBER FIELDS
OSTROWSKI FOR NUMBER FIELDS KEITH CONRAD Ostrowski classified the nontrivial absolute values on Q: up to equivalence, they are the usual (archimedean) absolute value and the p-adic absolute values for
More informationFactoring Dickson polynomials over finite fields
Factoring Dickson polynomials over finite fiels Manjul Bhargava Department of Mathematics, Princeton University. Princeton NJ 08544 manjul@math.princeton.eu Michael Zieve Department of Mathematics, University
More informationFaster deterministic integer factorisation
David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 The obvious mathematical breakthrough would be the development of an easy way to factor large prime numbers
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationHow To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
More information7. Some irreducible polynomials
7. Some irreducible polynomials 7.1 Irreducibles over a finite field 7.2 Worked examples Linear factors x α of a polynomial P (x) with coefficients in a field k correspond precisely to roots α k [1] of
More informationContinuity of the Perron Root
Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationOn the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression
On the irreducibility of certain polynomials with coefficients as products of terms in an arithmetic progression Carrie E. Finch and N. Saradha Abstract We prove the irreducibility of ceratin polynomials
More informationFactorization Theorems
Chapter 7 Factorization Theorems This chapter highlights a few of the many factorization theorems for matrices While some factorization results are relatively direct, others are iterative While some factorization
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationAn example of a computable
An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationOn the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
More informationELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM
ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationTHE BIRCH AND SWINNERTON-DYER CONJECTURE
THE BIRCH AND SWINNERTON-DYER CONJECTURE ANDREW WILES A polynomial relation f(x, y) = 0 in two variables defines a curve C 0. If the coefficients of the polynomial are rational numbers, then one can ask
More informationNotes 11: List Decoding Folded Reed-Solomon Codes
Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded Reed-Solomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationThe van Hoeij Algorithm for Factoring Polynomials
The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationInteger Factorization using the Quadratic Sieve
Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give
More informationON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
More informationTHE DIMENSION OF A VECTOR SPACE
THE DIMENSION OF A VECTOR SPACE KEITH CONRAD This handout is a supplementary discussion leading up to the definition of dimension and some of its basic properties. Let V be a vector space over a field
More informationA SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS
A SURVEY ON CONTINUOUS ELLIPTICAL VECTOR DISTRIBUTIONS Eusebio GÓMEZ, Miguel A. GÓMEZ-VILLEGAS and J. Miguel MARÍN Abstract In this paper it is taken up a revision and characterization of the class of
More informationLecture 13: Factoring Integers
CS 880: Quantum Information Processing 0/4/0 Lecture 3: Factoring Integers Instructor: Dieter van Melkebeek Scribe: Mark Wellons In this lecture, we review order finding and use this to develop a method
More informationH/wk 13, Solutions to selected problems
H/wk 13, Solutions to selected problems Ch. 4.1, Problem 5 (a) Find the number of roots of x x in Z 4, Z Z, any integral domain, Z 6. (b) Find a commutative ring in which x x has infinitely many roots.
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationDie ganzen zahlen hat Gott gemacht
Die ganzen zahlen hat Gott gemacht Polynomials with integer values B.Sury A quote attributed to the famous mathematician L.Kronecker is Die Ganzen Zahlen hat Gott gemacht, alles andere ist Menschenwerk.
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationA PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang
A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS XAVIER CABRÉ, MANEL SANCHÓN, AND JOEL SPRUCK In memory of Rou-Huai Wang 1. Introduction In this note we consider semistable
More informationarxiv:math/0601660v3 [math.nt] 25 Feb 2006
NOTES Edited by William Adkins arxiv:math/666v3 [math.nt] 25 Feb 26 A Short Proof of the Simple Continued Fraction Expansion of e Henry Cohn. INTRODUCTION. In [3], Euler analyzed the Riccati equation to
More informationPROOFS BY DESCENT KEITH CONRAD
PROOFS BY DESCENT KEITH CONRAD As ordinary methods, such as are found in the books, are inadequate to proving such difficult propositions, I discovered at last a most singular method... that I called the
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationMath 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.
Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(
More informationArithmetic algorithms for cryptology 5 October 2015, Paris. Sieves. Razvan Barbulescu CNRS and IMJ-PRG. R. Barbulescu Sieves 0 / 28
Arithmetic algorithms for cryptology 5 October 2015, Paris Sieves Razvan Barbulescu CNRS and IMJ-PRG R. Barbulescu Sieves 0 / 28 Starting point Notations q prime g a generator of (F q ) X a (secret) integer
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationBipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES. 1. Introduction
F A S C I C U L I M A T H E M A T I C I Nr 51 2013 Bipan Hazarika ON ACCELERATION CONVERGENCE OF MULTIPLE SEQUENCES Abstract. In this article the notion of acceleration convergence of double sequences
More informationPRIME FACTORS OF CONSECUTIVE INTEGERS
PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in
More informationFiber sums of genus 2 Lefschetz fibrations
Proceedings of 9 th Gökova Geometry-Topology Conference, pp, 1 10 Fiber sums of genus 2 Lefschetz fibrations Denis Auroux Abstract. Using the recent results of Siebert and Tian about the holomorphicity
More informationOn continued fractions of the square root of prime numbers
On continued fractions of the square root of prime numbers Alexandra Ioana Gliga March 17, 2006 Nota Bene: Conjecture 5.2 of the numerical results at the end of this paper was not correctly derived from
More informationBenford s Law and Fraud Detection, or: Why the IRS Should Care About Number Theory!
Benford s Law and Fraud Detection, or: Why the IRS Should Care About Number Theory! Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ Bronfman Science
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationA New Generic Digital Signature Algorithm
Groups Complex. Cryptol.? (????), 1 16 DOI 10.1515/GCC.????.??? de Gruyter???? A New Generic Digital Signature Algorithm Jennifer Seberry, Vinhbuu To and Dongvu Tonien Abstract. In this paper, we study
More informationA note on companion matrices
Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod
More informationLecture Notes on Polynomials
Lecture Notes on Polynomials Arne Jensen Department of Mathematical Sciences Aalborg University c 008 Introduction These lecture notes give a very short introduction to polynomials with real and complex
More informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationThe Division Algorithm for Polynomials Handout Monday March 5, 2012
The Division Algorithm for Polynomials Handout Monday March 5, 0 Let F be a field (such as R, Q, C, or F p for some prime p. This will allow us to divide by any nonzero scalar. (For some of the following,
More informationDoug Ravenel. October 15, 2008
Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we
More information9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.
9. POLYNOMIALS 9.1. Definition of a Polynomial A polynomial is an expression of the form: a(x) = a n x n + a n-1 x n-1 +... + a 1 x + a 0. The symbol x is called an indeterminate and simply plays the role
More informationEMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION
EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION CHRISTIAN ROBENHAGEN RAVNSHØJ Abstract. Consider the Jacobian of a genus two curve defined over a finite field and with complex multiplication.
More informationIs n a Prime Number? Manindra Agrawal. March 27, 2006, Delft. IIT Kanpur
Is n a Prime Number? Manindra Agrawal IIT Kanpur March 27, 2006, Delft Manindra Agrawal (IIT Kanpur) Is n a Prime Number? March 27, 2006, Delft 1 / 47 Overview 1 The Problem 2 Two Simple, and Slow, Methods
More informationSecond Order Differential Equations with Hypergeometric Solutions of Degree Three
Second Order Differential Equations with Hypergeometric Solutions of Degree Three Vijay Jung Kunwar, Mark van Hoeij Department of Mathematics, Florida State University Tallahassee, FL 0-07, USA vkunwar@mathfsuedu,
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More information