Computing Klein modular forms

Size: px
Start display at page:

Download "Computing Klein modular forms"

Transcription

1 Université de Bordeaux July 24, 2014 Paris 13 Workshop on Analytic Number Theory and Geometry

2 1 Motivation 2 3 4

3 Elliptic curves and automorphic forms Want a database of elliptic curves over number field F?

4 Elliptic curves and automorphic forms Want a database of elliptic curves over number field F? Start with GL 2 automorphic forms! Where do you find automorphic forms?

5 Elliptic curves and automorphic forms Want a database of elliptic curves over number field F? Start with GL 2 automorphic forms! Where do you find automorphic forms? In the cohomology of arithmetic groups! Matsushima s formula: Γ discrete cocompact subgroup of connected Lie group G, E representation of G. H i (Γ, E) = π ĜHom(π, L 2 (Γ\G)) H i (g, K;π E)

6 Automorphic forms for GL 2 Where do you find GL 2 automorphic forms?

7 Automorphic forms for GL 2 Where do you find GL 2 automorphic forms? H (GL 2 (Z F ), E)

8 Automorphic forms for GL 2 Where do you find GL 2 automorphic forms? H (GL 2 (Z F ), E) Jacquet Langlands: H (O, E), O order in a quaternion algebra

9 Automorphic forms for GL 2 Where do you find GL 2 automorphic forms? H (GL 2 (Z F ), E) Jacquet Langlands: H (O, E), O order in a quaternion algebra Kleinian case: O GL 2 (C), H 1 (O, E)

10 Automorphic forms for GL 2 Where do you find GL 2 automorphic forms? H (GL 2 (Z F ), E) Jacquet Langlands: H (O, E), O order in a quaternion algebra Kleinian case: O GL 2 (C), H 1 (O, E) Call H i (O, E) a space of Klein modular forms.

11 Motivation for the Kleinian case Elliptic curves, abelian varieties of GL 2 type over number fields.

12 Motivation for the Kleinian case Elliptic curves, abelian varieties of GL 2 type over number fields. Torsion phenomenon.

13

14 Kleinian groups Motivation H := C+Cj where j 2 = 1 and jz = zj for all z C. The upper half-space H 3 := C+R >0 j. Metric ds 2 = dz 2 +dt 2, volume dv = t 2 dx dy dt t 3.

15 Kleinian groups Motivation H := C+Cj where j 2 = 1 and jz = zj for all z C. The upper half-space H 3 := C+R >0 j. Metric ds 2 = dz 2 +dt 2, volume dv = t 2 ( a b c d ) w := (aw + b)(cw + d) 1 for dx dy dt t 3. ( ) a b SL c d 2 (C).

16 Kleinian groups Motivation H := C+Cj where j 2 = 1 and jz = zj for all z C. The upper half-space H 3 := C+R >0 j. Metric ds 2 = dz 2 +dt 2, volume dv = t 2 ( a b c d ) w := (aw + b)(cw + d) 1 for dx dy dt t 3. Kleinian group: discrete subgroup of PSL 2 (C). Cofinite if it has finite covolume. ( ) a b SL c d 2 (C).

17 Quaternion algebras A quaternion algebra B over a field F is a central simple algebra of dimension 4 over F. ) Explicitly, B = = F + Fi + Fj + Fij, i 2 = a, j 2 = b, ij = ji (char F 2). ( a,b F

18 Quaternion algebras A quaternion algebra B over a field F is a central simple algebra of dimension 4 over F. ) Explicitly, B = = F + Fi + Fj + Fij, i 2 = a, j 2 = b, ij = ji (char F 2). ( a,b F Reduced norm: nrd(x + yi + zj + tij) = x 2 ay 2 bz 2 + abt 2.

19 Quaternion algebras A quaternion algebra B over a field F is a central simple algebra of dimension 4 over F. ) Explicitly, B = = F + Fi + Fj + Fij, i 2 = a, j 2 = b, ij = ji (char F 2). ( a,b F Reduced norm: nrd(x + yi + zj + tij) = x 2 ay 2 bz 2 + abt 2. Z F integers of F number field. Order O B: subring, finitely generated Z F -module, OF = B.

20 Quaternion algebras A quaternion algebra B over a field F is a central simple algebra of dimension 4 over F. ) Explicitly, B = = F + Fi + Fj + Fij, i 2 = a, j 2 = b, ij = ji (char F 2). ( a,b F Reduced norm: nrd(x + yi + zj + tij) = x 2 ay 2 bz 2 + abt 2. Z F integers of F number field. Order O B: subring, finitely generated Z F -module, OF = B. A place v of F is split or ramified according as whether B F F v is M 2 (F v ) or a division algebra.

21 Covolume formula Motivation F almost totally real number field: exactly one complex place. B/F Kleinian quaternion algebra: ramified at every real place.

22 Covolume formula Motivation F almost totally real number field: exactly one complex place. B/F Kleinian quaternion algebra: ramified at every real place. O order in B, Γ image of reduced norm one group O 1 in PSL 2 (C).

23 Covolume formula Motivation F almost totally real number field: exactly one complex place. B/F Kleinian quaternion algebra: ramified at every real place. O order in B, Γ image of reduced norm one group O 1 in PSL 2 (C). Theorem Γ is a cofinite Kleinian group. It is cocompact iff B is a division algebra. If O is maximal then Covol(Γ) = F 3/2 ζ F (2) p ram. (N(p) 1) (4π 2 ) [F:Q] 1

24

25 Sketch of algorithm Motivation 1 Compute B and O

26 Sketch of algorithm Motivation 1 Compute B and O 2 Compute O 1

27 Sketch of algorithm Motivation 1 Compute B and O 2 Compute O 1 3 Compute H 1 (O 1 )

28 Sketch of algorithm Motivation 1 Compute B and O 2 Compute O 1 3 Compute H 1 (O 1 ) 4 Compute generator δ of ideal of norm p

29 Sketch of algorithm Motivation 1 Compute B and O 2 Compute O 1 3 Compute H 1 (O 1 ) 4 Compute generator δ of ideal of norm p 5 Compute Hecke operator T δ on H 1 (O 1 )

30 Fundamental domains Γ a Kleinian group. An open subset F H 3 is a fundamental domain if Γ F = H 3 F γf = for all 1 γ Γ.

31 Dirichlet domains Motivation

32 Dirichlet domains Motivation Let p H 3 with trivial stabilizer in Γ. The Dirichlet domain D p (Γ) := {x X d(x, p) < d(γ x, p) γ Γ\{1}} = {x X d(x, p) < d(x,γ 1 p) γ Γ\{1}}.

33 Dirichlet domains Motivation Let p H 3 with trivial stabilizer in Γ. The Dirichlet domain D p (Γ) := {x X d(x, p) < d(γ x, p) γ Γ\{1}} = {x X d(x, p) < d(x,γ 1 p) γ Γ\{1}}. is a fundamental domain for Γ that is a hyperbolic polyhedron. If Γ is cofinite, D p (Γ) has finitely many faces.

34 Structure of the Dirichlet domain

35 Structure of the Dirichlet domain Faces of the Dirichlet domain are grouped into pairs, corresponding to elements g, g 1 Γ;

36 Structure of the Dirichlet domain Faces of the Dirichlet domain are grouped into pairs, corresponding to elements g, g 1 Γ; Edges of the domain are grouped into cycles, product of corresponding elements in Γ has finite order.

37 Poincaré s theorem Motivation Theorem (Poincaré) The elements corresponding to the faces are generators of Γ. The relations corresponding to the edge cycles generate all the relations among the generators.

38 Poincaré s theorem Motivation Theorem (Poincaré) The elements corresponding to the faces are generators of Γ. The relations corresponding to the edge cycles generate all the relations among the generators. If a partial Dirichlet domain D p (S) has a face-pairing and cycles of edges, then it is a fundamental domain for the group generated by S.

39 Reduction algorithm x H 3, S Γ corresponding to the faces of D p (Γ).

40 Reduction algorithm x H 3, S Γ corresponding to the faces of D p (Γ). if possible x gx for some g S s.t. d(x, p) decreases

41 Reduction algorithm x H 3, S Γ corresponding to the faces of D p (Γ). if possible x gx for some g S s.t. d(x, p) decreases repeat

42 Reduction algorithm x H 3, S Γ corresponding to the faces of D p (Γ). if possible x gx for some g S s.t. d(x, p) decreases repeat point x = g k g 1 x s.t. x D p (Γ).

43 Reduction algorithm x H 3, S Γ corresponding to the faces of D p (Γ). if possible x gx for some g S s.t. d(x, p) decreases repeat point x = g k g 1 x s.t. x D p (Γ). In particular for γ Γ, take x = γ 1 p, which will reduce to x = p, to write γ as a product of the generators.

44 Computation in hyperbolic space

45 Computation in hyperbolic space We have : an explicit formula for the hyperbolic distance;

46 Computation in hyperbolic space We have : an explicit formula for the hyperbolic distance; an explicit formula for bisectors;

47 Computation in hyperbolic space We have : an explicit formula for the hyperbolic distance; an explicit formula for bisectors; an algorithm for computing intersections of half-spaces;

48 Computation in hyperbolic space We have : an explicit formula for the hyperbolic distance; an explicit formula for bisectors; an algorithm for computing intersections of half-spaces; an algorithm for computing the volume of a polyhedron.

49 Algorithm Motivation Suppose O maximal.

50 Algorithm Motivation Suppose O maximal. Enumerate elements of O 1 in a finite set S

51 Algorithm Motivation Suppose O maximal. Enumerate elements of O 1 in a finite set S Compute D = D p (S)

52 Algorithm Motivation Suppose O maximal. Enumerate elements of O 1 in a finite set S Compute D = D p (S) Repeat until D has a face-pairing and Vol(D) < 2 Covol(Γ)

53 Complexity Motivation Why would you care about the complexity?

54 Complexity Motivation Why would you care about the complexity? Bound on the size of the Dirichlet domain:

55 Complexity Motivation Why would you care about the complexity? Bound on the size of the Dirichlet domain: SL 2 (C) action on π = L 2 0 (Γ\ SL 2(C)) has property (τ): There are explicit Q SL 2 (C) compact and ǫ > 0, s.t. for all f π, there exists g Q s.t. gf f ǫ f.

56 Complexity Motivation Why would you care about the complexity? Bound on the size of the Dirichlet domain: SL 2 (C) action on π = L 2 0 (Γ\ SL 2(C)) has property (τ): There are explicit Q SL 2 (C) compact and ǫ > 0, s.t. for all f π, there exists g Q s.t. gf f ǫ f. diam(d p (Γ)) log Covol(Γ)

57 Complexity Motivation Why would you care about the complexity? Bound on the size of the Dirichlet domain: SL 2 (C) action on π = L 2 0 (Γ\ SL 2(C)) has property (τ): There are explicit Q SL 2 (C) compact and ǫ > 0, s.t. for all f π, there exists g Q s.t. gf f ǫ f. diam(d p (Γ)) log Covol(Γ) Proved complexity: Covol(Γ) O(1) Observed complexity: Covol(Γ) 2 Lower bound: Covol(Γ)

58 Group cohomology Motivation

59 Group cohomology Motivation Cocycles : Z 1 (Γ, E) := {φ : Γ E φ(gh) = φ(g)+g φ(h) g, h Γ}

60 Group cohomology Motivation Cocycles : Z 1 (Γ, E) := {φ : Γ E φ(gh) = φ(g)+g φ(h) g, h Γ} Coboundaries : B 1 (Γ, E) := {φ x : g x g x : x E} Z 1 (Γ, E)

61 Group cohomology Motivation Cocycles : Z 1 (Γ, E) := {φ : Γ E φ(gh) = φ(g)+g φ(h) g, h Γ} Coboundaries : B 1 (Γ, E) := {φ x : g x g x : x E} Z 1 (Γ, E) Cohomology : H 1 (Γ, E) := Z 1 (Γ, E)/B 1 (Γ, E)

62 Hecke operators Motivation Let δ Comm(Γ). H i (Γ, M)

63 Hecke operators Motivation Let δ Comm(Γ). H i (Γ, M) Res H i (Γ δγδ 1, M)

64 Hecke operators Motivation Let δ Comm(Γ). H i (Γ, M) Res H i (Γ δγδ 1, M) δ H i (δ 1 Γδ Γ, M)

65 Hecke operators Motivation Let δ Comm(Γ). H i (Γ, M) H i (Γ, M) Res H i (Γ δγδ 1, M) δ Cores H i (δ 1 Γδ Γ, M)

66 Hecke operators Motivation Let δ Comm(Γ). H i (Γ, M) Res T δ H i (Γ δγδ 1, M) δ H i (Γ, M) Cores H i (δ 1 Γδ Γ, M)

67 Principal ideal problem Recall: have to find a generator δ of ideal of norm p = (π).

68 Principal ideal problem Recall: have to find a generator δ of ideal of norm p = (π). Search in {nrd = π}/o 1 : complexity O(1) B.

69 Principal ideal problem Recall: have to find a generator δ of ideal of norm p = (π). Search in {nrd = π}/o 1 : complexity O(1) B. Buchmann s algorithm over number fields: subexponential under GRH.

70 Principal ideal problem Recall: have to find a generator δ of ideal of norm p = (π). Search in {nrd = π}/o 1 : complexity O(1) B. Buchmann s algorithm over number fields: subexponential under GRH. Adapt Buchmann s algorithm over a quaternion algebra: heuristically subexponential, efficient in practice.

71

72 A quartic example Motivation Let F the unique quartic field of signature (2, 1) and discriminant 275. Let B be the unique quaternion algebra with discriminant 11Z F, ramified at every real place of F. Let O be a maximal order in B (it is unique up to conjugation). Then O 1 is a Kleinian group with covolume The fundamental domain I have computed has 310 faces and 924 edges.

73 A quartic example Motivation Let F the unique quartic field of signature (2, 1) and discriminant 275. Let B be the unique quaternion algebra with discriminant 11Z F, ramified at every real place of F. Let O be a maximal order in B (it is unique up to conjugation). Then O 1 is a Kleinian group with covolume The fundamental domain I have computed has 310 faces and 924 edges. Have a look at the fundamental domain!

74 A quartic example Motivation N(p) T p characteristic polynomial (x + 5)(x 2 5x 2) same (x + 5)(x 2 5x 2) (x + 8)(x 2 x 8) x(x + 4) same x(x + 4) 2 25 (x + 9)(x 2 x 74) 29 x(x 2 + 6x 24) 29 x(x 2 + 6x 24)

75 Non base-change classes Bianchi groups: Γ = SL 2 (Z F ) with F quadratic imaginary.

76 Non base-change classes Bianchi groups: Γ = SL 2 (Z F ) with F quadratic imaginary. Finis, Grunewald, Tirao: formula for the base-change subspace in H i (Γ, E k ). Remark: very few non base-change classes.

77 Non base-change classes Bianchi groups: Γ = SL 2 (Z F ) with F quadratic imaginary. Finis, Grunewald, Tirao: formula for the base-change subspace in H i (Γ, E k ). Remark: very few non base-change classes. Şengün, Rahm: extended their computations.

78 Non base-change classes Bianchi groups: Γ = SL 2 (Z F ) with F quadratic imaginary. Finis, Grunewald, Tirao: formula for the base-change subspace in H i (Γ, E k ). Remark: very few non base-change classes. Şengün, Rahm: extended their computations. Question (Modified Maeda s conjecture) Does the set of non-lifted cuspidal newforms in H i (Γ, E k ), modulo twins, forms one Galois orbit? Is it true for k 0?

79 Non base-change classes Bianchi groups: Γ = SL 2 (Z F ) with F quadratic imaginary. Finis, Grunewald, Tirao: formula for the base-change subspace in H i (Γ, E k ). Remark: very few non base-change classes. Şengün, Rahm: extended their computations. Question (Modified Maeda s conjecture) Does the set of non-lifted cuspidal newforms in H i (Γ, E k ), modulo twins, forms one Galois orbit? Is it true for k 0? Experiment : always dimension 2 space, except (d, k) = ( 199, 2): dimension 4.

80 Non base-change classes Bianchi groups: Γ = SL 2 (Z F ) with F quadratic imaginary. Finis, Grunewald, Tirao: formula for the base-change subspace in H i (Γ, E k ). Remark: very few non base-change classes. Şengün, Rahm: extended their computations. Question (Modified Maeda s conjecture) Does the set of non-lifted cuspidal newforms in H i (Γ, E k ), modulo twins, forms one Galois orbit? Is it true for k 0? Experiment : always dimension 2 space, except (d, k) = ( 199, 2): dimension 4. Two twin Galois orbits with coefficients in Q( 13), swapped by Gal(F/Q).

81 Everywhere good reduction abelian surfaces Bianchi group for F = Q( 223).

82 Everywhere good reduction abelian surfaces Bianchi group for F = Q( 223). Have a look at the fundamental domain!

83 Everywhere good reduction abelian surfaces Bianchi group for F = Q( 223). Have a look at the fundamental domain! Cuspidal subspace in H 1 (Γ,C): dimension 2, one Galois orbit in Q( 2).

84 Everywhere good reduction abelian surfaces Bianchi group for F = Q( 223). Have a look at the fundamental domain! Cuspidal subspace in H 1 (Γ,C): dimension 2, one Galois orbit in Q( 2). Şengün, Dembélé : the Jacobian J of the hyperelliptic curve y 2 = 33x x x x x x has good reduction everywhere, End(J) Q = Q( 2) and matches the Hecke eigenvalues.

85 Everywhere good reduction abelian surfaces Bianchi group for F = Q( 223). Have a look at the fundamental domain! Cuspidal subspace in H 1 (Γ,C): dimension 2, one Galois orbit in Q( 2). Şengün, Dembélé : the Jacobian J of the hyperelliptic curve y 2 = 33x x x x x x has good reduction everywhere, End(J) Q = Q( 2) and matches the Hecke eigenvalues. Looking for more examples in Q( 455) and Q( 571).

86 Torsion Jacquet-Langlands Can also look at H 1 (Γ,Z) tor and H 1 (Γ,F p ).

87 Torsion Jacquet-Langlands Can also look at H 1 (Γ,Z) tor and H 1 (Γ,F p ). Jacquet Langlands: relation between (co)homology of Γ 0 (N) in a Bianchi group and that of Γ coming from a division algebra of discriminant N.

88 Torsion Jacquet-Langlands Can also look at H 1 (Γ,Z) tor and H 1 (Γ,F p ). Jacquet Langlands: relation between (co)homology of Γ 0 (N) in a Bianchi group and that of Γ coming from a division algebra of discriminant N. Calegari, Venkatesh: numerical torsion Jacquet-Langlands correspondence.

89 Torsion Jacquet-Langlands Can also look at H 1 (Γ,Z) tor and H 1 (Γ,F p ). Jacquet Langlands: relation between (co)homology of Γ 0 (N) in a Bianchi group and that of Γ coming from a division algebra of discriminant N. Calegari, Venkatesh: numerical torsion Jacquet-Langlands correspondence. Joint with H. Şengün: experimental verification with Hecke operators (still in progress).

90 Thank you for your attention!

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number

A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α K. The minimal polynomial Let K be a number field and

More information

Galois representations with open image

Galois representations with open image Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group

More information

How To Prove The Dirichlet Unit Theorem

How 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 information

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON 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 information

Inner Product Spaces

Inner 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 information

Ideal Class Group and Units

Ideal Class Group and Units Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals

More information

Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2

Sign 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 information

Galois Theory III. 3.1. Splitting fields.

Galois Theory III. 3.1. Splitting fields. Galois Theory III. 3.1. Splitting fields. We know how to construct a field extension L of a given field K where a given irreducible polynomial P (X) K[X] has a root. We need a field extension of K where

More information

Metric Spaces. Chapter 7. 7.1. Metrics

Metric 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

On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems

On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Dynamics at the Horsetooth Volume 2, 2010. On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Eric Hanson Department of Mathematics Colorado State University

More information

Recent work on Serre s conjectures

Recent work on Serre s conjectures Recent work on Serre s conjectures Kenneth A. Ribet University of California, Berkeley June 4, 2005 Canadian Math Society Summer Meeting This talk concerns a new chapter in a story that began in the late

More information

On the largest prime factor of x 2 1

On 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 information

4. Expanding dynamical systems

4. Expanding dynamical systems 4.1. Metric definition. 4. Expanding dynamical systems Definition 4.1. Let X be a compact metric space. A map f : X X is said to be expanding if there exist ɛ > 0 and L > 1 such that d(f(x), f(y)) Ld(x,

More information

How To Find Out How To Build An Elliptic Curve Over A Number Field

How To Find Out How To Build An Elliptic Curve Over A Number Field Numbers Volume 2015, Article ID 501629, 4 pages http://dx.doi.org/10.1155/2015/501629 Research Article On the Rank of Elliptic Curves in Elementary Cubic Extensions Rintaro Kozuma College of International

More information

EMBEDDING DEGREE OF HYPERELLIPTIC CURVES WITH COMPLEX MULTIPLICATION

EMBEDDING 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 information

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

CHAPTER 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 information

Introduction to Topology

Introduction to Topology Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

More information

ECE 842 Report Implementation of Elliptic Curve Cryptography

ECE 842 Report Implementation of Elliptic Curve Cryptography ECE 842 Report Implementation of Elliptic Curve Cryptography Wei-Yang Lin December 15, 2004 Abstract The aim of this report is to illustrate the issues in implementing a practical elliptic curve cryptographic

More information

Study of algorithms for factoring integers and computing discrete logarithms

Study of algorithms for factoring integers and computing discrete logarithms Study of algorithms for factoring integers and computing discrete logarithms First Indo-French Workshop on Cryptography and Related Topics (IFW 2007) June 11 13, 2007 Paris, France Dr. Abhijit Das Department

More information

4. BINARY QUADRATIC FORMS

4. BINARY QUADRATIC FORMS 4. BINARY QUADRATIC FORMS 4.1. What integers are represented by a given binary quadratic form?. An integer n is represented by the binary quadratic form ax + bxy + cy if there exist integers r and s such

More information

minimal polyonomial Example

minimal polyonomial Example Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

More information

EXPLICIT METHODS FOR HILBERT MODULAR FORMS

EXPLICIT METHODS FOR HILBERT MODULAR FORMS EXPLICIT METHODS FOR HILBERT MODULAR FORMS LASSINA DEMBÉLÉ AND JOHN VOIGHT Abstract. We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real

More information

Basics of Polynomial Theory

Basics of Polynomial Theory 3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where

More information

Prime numbers and prime polynomials. Paul Pollack Dartmouth College

Prime 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 information

EXERCISES FOR THE COURSE MATH 570, FALL 2010

EXERCISES FOR THE COURSE MATH 570, FALL 2010 EXERCISES FOR THE COURSE MATH 570, FALL 2010 EYAL Z. GOREN (1) Let G be a group and H Z(G) a subgroup such that G/H is cyclic. Prove that G is abelian. Conclude that every group of order p 2 (p a prime

More information

MATH 381 HOMEWORK 2 SOLUTIONS

MATH 381 HOMEWORK 2 SOLUTIONS MATH 38 HOMEWORK SOLUTIONS Question (p.86 #8). If g(x)[e y e y ] is harmonic, g() =,g () =, find g(x). Let f(x, y) = g(x)[e y e y ].Then Since f(x, y) is harmonic, f + f = and we require x y f x = g (x)[e

More information

MA 408 Computer Lab Two The Poincaré Disk Model of Hyperbolic Geometry. Figure 1: Lines in the Poincaré Disk Model

MA 408 Computer Lab Two The Poincaré Disk Model of Hyperbolic Geometry. Figure 1: Lines in the Poincaré Disk Model MA 408 Computer Lab Two The Poincaré Disk Model of Hyperbolic Geometry Put your name here: Score: Instructions: For this lab you will be using the applet, NonEuclid, created by Castellanos, Austin, Darnell,

More information

Chapter 13: Basic ring theory

Chapter 13: Basic ring theory Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring

More information

Cyclotomic Extensions

Cyclotomic Extensions Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate

More information

Notes on metric spaces

Notes on metric spaces Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.

More information

Finite covers of a hyperbolic 3-manifold and virtual fibers.

Finite covers of a hyperbolic 3-manifold and virtual fibers. Claire Renard Institut de Mathématiques de Toulouse November 2nd 2011 Some conjectures. Let M be a hyperbolic 3-manifold, connected, closed and oriented. Theorem (Kahn, Markovic) The fundamental group

More information

Software Development within the SPP1489: Number Theory

Software Development within the SPP1489: Number Theory Software Development within the SPP1489: Number Theory Claus Fieker and Bill Hart, Tommy Hofmann and others September 29, 2015 Computer algebra is incomplete without number theory. Applications: (small

More information

Topological Algebraic Geometry Workshop Oslo, September 4th-8th, 2006. Spectra associated with Artin-Schreier curves. Doug Ravenel

Topological Algebraic Geometry Workshop Oslo, September 4th-8th, 2006. Spectra associated with Artin-Schreier curves. Doug Ravenel Topological Algebraic Geometry Workshop Oslo, September 4th-8th, 2006 Spectra associated with Artin-Schreier curves Doug Ravenel University of Rochester September 6, 2006 1 2 1. My favorite part of the

More information

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction 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 information

DECOMPOSING SL 2 (R)

DECOMPOSING SL 2 (R) DECOMPOSING SL 2 R KEITH CONRAD Introduction The group SL 2 R is not easy to visualize: it naturally lies in M 2 R, which is 4- dimensional the entries of a variable 2 2 real matrix are 4 free parameters

More information

How To Know The Limit Set Of A Fuchsian Group On A Boundary Of A Hyperbolic Plane

How To Know The Limit Set Of A Fuchsian Group On A Boundary Of A Hyperbolic Plane Reading material on the limit set of a Fuchsian group Recommended texts Many books on hyperbolic geometry and Kleinian and Fuchsian groups contain material about limit sets. The presentation given here

More information

The Ideal Class Group

The Ideal Class Group Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

More information

Computing Cubic Fields in Quasi-Linear Time

Computing Cubic Fields in Quasi-Linear Time Computing Cubic Fields in Quasi-Linear Time K. Belabas Département de mathématiques (A2X) Université Bordeaux I 351, cours de la Libération, 33405 Talence (France) belabas@math.u-bordeaux.fr Cubic fields

More information

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS

ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair

More information

3 1. Note that all cubes solve it; therefore, there are no more

3 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 information

Let H and J be as in the above lemma. The result of the lemma shows that the integral

Let H and J be as in the above lemma. The result of the lemma shows that the integral Let and be as in the above lemma. The result of the lemma shows that the integral ( f(x, y)dy) dx is well defined; we denote it by f(x, y)dydx. By symmetry, also the integral ( f(x, y)dx) dy is well defined;

More information

by Ben Brubaker, Solomon Friedberg, and Jeffrey Hoffstein Stanford University Boston College Brown University

by Ben Brubaker, Solomon Friedberg, and Jeffrey Hoffstein Stanford University Boston College Brown University CUBIC TWISTS OF GL(2) AUTOMORPHIC L-FUNCTIONS by Ben Brubaker, Solomon Friedberg, and Jeffrey Hoffstein Stanford University Boston College Brown University Draft, November 5, 2003 Abstract. Let K = Q(

More information

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC 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 information

Factoring of Prime Ideals in Extensions

Factoring 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 information

Fiber bundles and non-abelian cohomology

Fiber bundles and non-abelian cohomology Fiber bundles and non-abelian cohomology Nicolas Addington April 22, 2007 Abstract The transition maps of a fiber bundle are often said to satisfy the cocycle condition. If we take this terminology seriously

More information

Planar Curve Intersection

Planar Curve Intersection Chapter 7 Planar Curve Intersection Curve intersection involves finding the points at which two planar curves intersect. If the two curves are parametric, the solution also identifies the parameter values

More information

Alex, I will take congruent numbers for one million dollars please

Alex, 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 information

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

More information

Mathematical Physics, Lecture 9

Mathematical Physics, Lecture 9 Mathematical Physics, Lecture 9 Hoshang Heydari Fysikum April 25, 2012 Hoshang Heydari (Fysikum) Mathematical Physics, Lecture 9 April 25, 2012 1 / 42 Table of contents 1 Differentiable manifolds 2 Differential

More information

Zeros of a Polynomial Function

Zeros of a Polynomial Function Zeros of a Polynomial Function An important consequence of the Factor Theorem is that finding the zeros of a polynomial is really the same thing as factoring it into linear factors. In this section we

More information

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents

DIFFERENTIABILITY OF COMPLEX FUNCTIONS. Contents DIFFERENTIABILITY OF COMPLEX FUNCTIONS Contents 1. Limit definition of a derivative 1 2. Holomorphic functions, the Cauchy-Riemann equations 3 3. Differentiability of real functions 5 4. A sufficient condition

More information

Zeros of Polynomial Functions

Zeros of Polynomial Functions Review: Synthetic Division Find (x 2-5x - 5x 3 + x 4 ) (5 + x). Factor Theorem Solve 2x 3-5x 2 + x + 2 =0 given that 2 is a zero of f(x) = 2x 3-5x 2 + x + 2. Zeros of Polynomial Functions Introduction

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

More information

Row Ideals and Fibers of Morphisms

Row Ideals and Fibers of Morphisms Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

More information

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

MATH 425, PRACTICE FINAL EXAM SOLUTIONS. MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator

More information

A characterization of trace zero symmetric nonnegative 5x5 matrices

A characterization of trace zero symmetric nonnegative 5x5 matrices A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the

More information

The Math Circle, Spring 2004

The Math Circle, Spring 2004 The Math Circle, Spring 2004 (Talks by Gordon Ritter) What is Non-Euclidean Geometry? Most geometries on the plane R 2 are non-euclidean. Let s denote arc length. Then Euclidean geometry arises from the

More information

A Minkowski-style bound for the orders of the finite subgroups of the Cremona group of rank 2 over an arbitrary field.

A Minkowski-style bound for the orders of the finite subgroups of the Cremona group of rank 2 over an arbitrary field. A Minkowski-style bound for the orders of the finite subgroups of the Cremona group of rank 2 over an arbitrary field Jean-Pierre Serre Let k be a field. Let Cr(k) be the Cremona group of rank 2 over k,

More information

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors

More information

POSTECH SUMMER SCHOOL 2013 LECTURE 4 INTRODUCTION TO THE TRACE FORMULA

POSTECH SUMMER SCHOOL 2013 LECTURE 4 INTRODUCTION TO THE TRACE FORMULA POSTECH SUMMER SCHOOL 2013 LECTURE 4 INTRODUCTION TO THE TRACE FORMULA 1. Kernel and the trace formula Beginning from this lecture, we will discuss the approach to Langlands functoriality conjecture based

More information

Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10

Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10 with Embedding Degree 10 University of California, Berkeley, USA ANTS-VII, 2006 Outline 1 Introduction 2 The CM Method: The Basic Construction The CM Method: Generating Families of Curves 3 Outline 1 Introduction

More information

GENERATING SETS KEITH CONRAD

GENERATING SETS KEITH CONRAD GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

More information

FINITE FIELDS KEITH CONRAD

FINITE FIELDS KEITH CONRAD FINITE FIELDS KEITH CONRAD This handout discusses finite fields: how to construct them, properties of elements in a finite field, and relations between different finite fields. We write Z/(p) and F p interchangeably

More information

Erdős on polynomials

Erdős on polynomials Erdős on polynomials Vilmos Totik University of Szeged and University of South Florida totik@mail.usf.edu Vilmos Totik (SZTE and USF) Polynomials 1 / * Erdős on polynomials Vilmos Totik (SZTE and USF)

More information

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

More information

The Brauer Manin obstruction for curves having split Jacobians

The Brauer Manin obstruction for curves having split Jacobians Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 The Brauer Manin obstruction for curves having split Jacobians par Samir SIKSEK Résumé. Soit X A un morphism (qui n est pas constant) d une

More information

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22 RAVI VAKIL CONTENTS 1. Discrete valuation rings: Dimension 1 Noetherian regular local rings 1 Last day, we discussed the Zariski tangent space, and saw that it

More information

Quotient Rings and Field Extensions

Quotient 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 information

College of the Holy Cross, Spring 2009 Math 373, Partial Differential Equations Midterm 1 Practice Questions

College of the Holy Cross, Spring 2009 Math 373, Partial Differential Equations Midterm 1 Practice Questions College of the Holy Cross, Spring 29 Math 373, Partial Differential Equations Midterm 1 Practice Questions 1. (a) Find a solution of u x + u y + u = xy. Hint: Try a polynomial of degree 2. Solution. Use

More information

1 Chapter I Solutions

1 Chapter I Solutions 1 Chapter I Solutions 1.1 Section 1 (TODO) 1 2 Chapter II Solutions 2.1 Section 1 1.16b. Given an exact sequence of sheaves 0 F F F 0 over a topological space X with F flasque show that for every open

More information

Math 115 Spring 2011 Written Homework 5 Solutions

Math 115 Spring 2011 Written Homework 5 Solutions . Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

More information

8.1 Examples, definitions, and basic properties

8.1 Examples, definitions, and basic properties 8 De Rham cohomology Last updated: May 21, 211. 8.1 Examples, definitions, and basic properties A k-form ω Ω k (M) is closed if dω =. It is exact if there is a (k 1)-form σ Ω k 1 (M) such that dσ = ω.

More information

Degrees of freedom in (forced) symmetric frameworks. Louis Theran (Aalto University / AScI, CS)

Degrees of freedom in (forced) symmetric frameworks. Louis Theran (Aalto University / AScI, CS) Degrees of freedom in (forced) symmetric frameworks Louis Theran (Aalto University / AScI, CS) Frameworks Graph G = (V,E); edge lengths l(ij); ambient dimension d Length eqns. pi - pj 2 = l(ij) 2 The p

More information

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets.

MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. MATH 304 Linear Algebra Lecture 20: Inner product spaces. Orthogonal sets. Norm The notion of norm generalizes the notion of length of a vector in R n. Definition. Let V be a vector space. A function α

More information

The Method of Partial Fractions Math 121 Calculus II Spring 2015

The Method of Partial Fractions Math 121 Calculus II Spring 2015 Rational functions. as The Method of Partial Fractions Math 11 Calculus II Spring 015 Recall that a rational function is a quotient of two polynomials such f(x) g(x) = 3x5 + x 3 + 16x x 60. The method

More information

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2. Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

More information

On prime-order elliptic curves with embedding degrees k = 3, 4 and 6

On prime-order elliptic curves with embedding degrees k = 3, 4 and 6 On prime-order elliptic curves with embedding degrees k = 3, 4 and 6 Koray Karabina and Edlyn Teske University of Waterloo ANTS VIII, Banff, May 20, 2008 K. Karabina and E. Teske (UW) Prime-order elliptic

More information

AP CALCULUS AB 2008 SCORING GUIDELINES

AP CALCULUS AB 2008 SCORING GUIDELINES AP CALCULUS AB 2008 SCORING GUIDELINES Question 1 Let R be the region bounded by the graphs of y = sin( π x) and y = x 4 x, as shown in the figure above. (a) Find the area of R. (b) The horizontal line

More information

Zeros of Polynomial Functions

Zeros of Polynomial Functions Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of

More information

2. Length and distance in hyperbolic geometry

2. Length and distance in hyperbolic geometry 2. Length and distance in hyperbolic geometry 2.1 The upper half-plane There are several different ways of constructing hyperbolic geometry. These different constructions are called models. In this lecture

More information

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0

THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 THE NUMBER OF REPRESENTATIONS OF n OF THE FORM n = x 2 2 y, x > 0, y 0 RICHARD J. MATHAR Abstract. We count solutions to the Ramanujan-Nagell equation 2 y +n = x 2 for fixed positive n. The computational

More information

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

More information

Finitely Additive Dynamic Programming and Stochastic Games. Bill Sudderth University of Minnesota

Finitely Additive Dynamic Programming and Stochastic Games. Bill Sudderth University of Minnesota Finitely Additive Dynamic Programming and Stochastic Games Bill Sudderth University of Minnesota 1 Discounted Dynamic Programming Five ingredients: S, A, r, q, β. S - state space A - set of actions q(

More information

Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher

Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC. Lee Mosher Mathematical Research Letters 1, 249 255 (1994) MAPPING CLASS GROUPS ARE AUTOMATIC Lee Mosher Let S be a compact surface, possibly with the extra structure of an orientation or a finite set of distinguished

More information

PYTHAGOREAN TRIPLES KEITH CONRAD

PYTHAGOREAN 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 information

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

More information

6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w.

6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w. hapter omplex integration. omplex number quiz. Simplify 3+4i. 2. Simplify 3+4i. 3. Find the cube roots of. 4. Here are some identities for complex conjugate. Which ones need correction? z + w = z + w,

More information

Techniques algébriques en calcul quantique

Techniques algébriques en calcul quantique Techniques algébriques en calcul quantique E. Jeandel Laboratoire de l Informatique du Parallélisme LIP, ENS Lyon, CNRS, INRIA, UCB Lyon 8 Avril 25 E. Jeandel, LIP, ENS Lyon Techniques algébriques en calcul

More information

26 Ideals and Quotient Rings

26 Ideals and Quotient Rings Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed

More information

Critically Periodic Cubic Polynomials

Critically Periodic Cubic Polynomials Critically Periodic Cubic Polynomials John Milnor Stony Brook University (www.math.sunysb.edu) IN MEMORY OF ADRIEN DOUADY Paris, May 26 2008 Parameter Space 1. THE PROBLEM: To study cubic polynomial maps

More information

Chapter 2. Parameterized Curves in R 3

Chapter 2. Parameterized Curves in R 3 Chapter 2. Parameterized Curves in R 3 Def. A smooth curve in R 3 is a smooth map σ : (a, b) R 3. For each t (a, b), σ(t) R 3. As t increases from a to b, σ(t) traces out a curve in R 3. In terms of components,

More information

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics 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 information

Evaluating large degree isogenies and applications to pairing based cryptography

Evaluating large degree isogenies and applications to pairing based cryptography Evaluating large degree isogenies and applications to pairing based cryptography Reinier Bröker, Denis Charles, and Kristin Lauter Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA reinierb@microsoft.com,

More information

Monogenic Fields and Power Bases Michael Decker 12/07/07

Monogenic 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 information

Schemes for Deterministic Polynomial Factoring

Schemes for Deterministic Polynomial Factoring Schemes for Deterministic Polynomial Factoring Gábor Ivanyos 1 Marek Karpinski 2 Nitin Saxena 3 1 Computer and Automation Research Institute, Budapest 2 Dept. of Computer Science, University of Bonn 3

More information

1 Symmetries of regular polyhedra

1 Symmetries of regular polyhedra 1230, notes 5 1 Symmetries of regular polyhedra Symmetry groups Recall: Group axioms: Suppose that (G, ) is a group and a, b, c are elements of G. Then (i) a b G (ii) (a b) c = a (b c) (iii) There is an

More information

Solutions to Homework 10

Solutions to Homework 10 Solutions to Homework 1 Section 7., exercise # 1 (b,d): (b) Compute the value of R f dv, where f(x, y) = y/x and R = [1, 3] [, 4]. Solution: Since f is continuous over R, f is integrable over R. Let x

More information

Prime Numbers and Irreducible Polynomials

Prime 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 information

SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO

SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO K. Hashimoto Nagoya Math. J. Vol. 77 (1980), 167-175 SOME EXAMPLES OF INTEGRAL DEFINITE QUATERNARY QUADRATIC FORMS WITH PRIME DISCRIMINANT KI-ICHIRO HASHIMOTO Introduction In the theory of integral quadratic

More information

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 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 information