Computing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm
|
|
- Melvin Cox
- 5 years ago
- Views:
Transcription
1 Computing the Monodromy Group of a Plane Algebraic Curve Using a New Numerical-modular Newton-Puiseux Algorithm Poteaux Adrien XLIM-DMI UMR CNRS 6172 Université de Limoges, France SNC'07 University of Western Ontario, Canada
2 Outline 1 Computing the monodromy group of a plane algebraic curve 2 A new numerical-modular Newton-Puiseux algorithm
3 The problem K subeld of C. F K[X, Y ] squarefree and monic in Y. C = {(x, y) C 2 F (x, y) = 0} the associated curve. Fiber at x 0 : F(x 0 ) = {roots of F (x 0, Y ) = 0}. Regular point : #F(x 0 ) = D Y. Critical point : #F(x 0 ) < D Y. δ(x 0 ) : distance between x 0 and its nearest critical point.
4 Regular points Let x 0 regular and F(x 0 ) = {y 1, y 2,..., y DY } the ber at x 0. Implicit function theorem : there exist D Y series Y i (X ) = α ik (X x 0 ) k s.t. F (X, Y i (X )) = 0 in the k=0 neighborhood of x 0 and Y i (x 0 ) = y i. The convergence radius of this series is at least δ(x 0 ). If γ is a path which does not meet any critical point, we can analytically continue the Y i along γ.
5 Critical points : Puiseux Series There exist d series Y ij (X ) = α ik ζe jk i (X x 0 ) k e i s.t. k=0 F (X, Y ij (X )) = 0 for all 1 j e i, 1 i s, with : ζ e = exp ( ) 2 πi e. e 1,..., e s a partition of D Y. The integer e i is the ramication index.
6 Critical points : Puiseux Series There exist d series Y ij (X ) = α ik ζe jk i (X x 0 ) k e i s.t. k=0 F (X, Y ij (X )) = 0 for all 1 j e i, 1 i s, with : ζ e = exp ( ) 2 πi e. e 1,..., e s a partition of D Y. The integer e i is the ramication index. G(X, Y ) = Y 3 X Examples at x 0 = 0 : Y 1 (X ) = X 1 3, Y 2 (X ) = jx 1 3, Y 3 (X ) = j 2 X 1 3. H(X, Y ) = (Y 3 X ) ((Y 1) 2 X ) (Y 2 X 2 ) + X 2 Y 5 Y 1k (X ) = j k X X j k X , k = 1, 2, 3. Y 2k (X ) = 1 + X 1 2 ± 1 2 X X 2 +, k = 1, 2. Y 31 (X ) = 2 3 X X 3 +
7 Local monodromy H(X, Y ) = (Y 3 X ) ((Y 1) 2 X ) (Y 2 X 2 ) + X 2 Y 5 Y 31 (X ) = 2 3 X X 3 + e = 1 : 1-cycle. Y 2k (X ) = 1 + X 1 2 ± 1 2 X e = 2 : 2-cycle. Y 1k (X ) = j k X X j k X e = 3 : 3-cycle. Local monodromy : Permutation generated on the ber. We get it from ramification indices!
8 Global monodromy Let c 1,..., c d denote the critical points. We x a regular base point a. We will compute the d permutations σ 1,..., σ d generated by γ 1,..., γ d. These permutations generate the monodromy group.
9 Motivations Galois theory. Multivariate polynomial factorization (Galligo-Van Hoeij ). First step towards an eective Abel-Jacobi theorem. Integration of algebraic functions (logarithmic part). Applications in Physics (KP equations...). Our long term goal : An implementation of the Abel map with provable accuracy bound.
10 Compute bers and connect 1 Choice of paths. 2 Choice of connection points. a
11 Compute bers and connect 1 Choice of paths. 2 Choice of connection points. a
12 Compute bers and connect 1 Choice of paths. 2 Choice of connection points. 3 Connection method. a
13 Monodromy : state of art (sketch) 1 Compute bers and connect Van Hoeij & Deconinck (2001) Maple's monodromy command. Fibers connected with rst order approximation. Heuristic connection criteria and error control. 2 Dierential equation Chudnovsky & Chudnovsky, Van der Hoeven...
14 Contributions 1 Choice of paths : Euclidean minimum spanning tree. 2 Connection method : truncated series expansions and Puiseux series above critical points. Certied connections. Local monodromy for free. Useful for Abel's map (Deconinck and Patterson 2007). A new numerical-modular algorithm to compute singular part of Puiseux series. 3 Choice of connection points : trade-o between truncation orders and number of steps. Bound for the number of steps.
15 Euclidean Minimum Spanning Tree
16 Connections along the tree
17 Number of connection points At this point, we need O(d) = O(D 2 ) connection points.
18 Truncation orders Let Y (X ) = k=0 µ k(x x 0 ) k e a Puiseux series, Ỹ (X ) = n k=0 µ k(x x 0 ) k e its order n truncation, x 1 D(x 0, ρ) with ρ < δ(x 0 ), M sup Y (x), x D(x 0,ρ) η R + the required precision, ) 1 e β =, ( x1 x 0 δ(x 0 ) Proposition n ln ( η ) M + ln(1 β) 1 Y (x 1 ) Ỹ (x 1 ) η ln(β) With F (X, Y ) = Y 3 X 5 + 2(10X 1) 2, we get β and n
19 Number of connection points If β = 1 2, we only need n 1 log 2 ( η M ). For [c jk, c k ], logarithmic number of connection points : ( ( )) δ(cjk ) O log 3 δ(c k ). Theorem If F Z[X, Y ], we need O(D 6 log F ) connection points to compute the monodromy group. bound cubic in the size of the output.
20 1 Minimize the length of the paths. 2 Series expansions : trade-o between truncation orders and number of steps. Bound for the number of steps. 3 Puiseux series above critical points : a fast numerical-modular algorithm.
21 Newton-Puiseux algorithm : singular part Symbolic algorithm : Bit complexity O(D Y 32 DX 4 ) (Walsh 2000) Purely numerical computation dicult : F (X, Y ) F (X q, Y + ξ 1 q X m ) F (X, Y ) = i, j a ij X j Y i Characteristic polynomial: φ (Z) = i i 0 a ij Z q (i, j) ξ root of φ.
22 A numerical-modular algorithm 1 Compute singular part of Puiseux series modulo a good p. This gives us : Rational exponents m with q 1. q Multiplicities of roots of φ (Z) when it has several factors. Choice of p : can be deduced from the discriminant. 2 Guide numerical computations by this modular information. Complexity for the singular part : O (D Y 4 DX 2 ) modular and oating point computations.
23 Numerical precision F (X, Y ) = (Y 3 M 10,6 (X ))(Y 3 M 10,3 (X )) + Y 2 X 5 A factor of the discriminant has 30 degree and coecients > Number of correct digits for the singular part coecients : Digits Symbolic + Numeric Our algorithm
24 Running time ( Y n 2 P n G n (X, Y ) = with P n0 (X ) = 1 ( n 03! X X n 0 + (n 0 1) X 1 n 0! ) 2 (X ) G n 2 (X, Y ) ). Polynomial Running time Our algorithm for symbolic time precision G s s 9 G s s 9 G s s 9 G s s 9 G s s 9 G s s 9 G s s 9 Prime number used : p =
25 Conclusions Modular computations yield an ecient algorithm for oating point Puiseux series above critical points. Monodromy groups can be computed using controlled number of steps and truncation orders. Paths can be optimized. Future work Control round-o errors and analyze accuracy. Rene the monodromy algorithm. Finalize complexity. Improve implementation.
Computing Monodromy Groups Defined by Plane Algebraic Curves. Adrien Poteaux
Algorithms Seminar 2006 2007, F. Chyzak (ed.), INRIA Available online at the URL http://algo.inria.fr/seminars/. Computing Monodromy Groups Defined by Plane Algebraic Curves Adrien Poteaux Xlim-Dmi, umr
More informationComputing Monodromy Groups defined by Plane Algebraic Curves
Computing Monodromy Groups defined by Plane Algebraic Curves Adrien Poteaux XLIM - DMI, UMR CNRS 6172 Universit«e de Limoges adrien.poteaux@unilim.fr ABSTRACT We present a symbolic-numeric method to compute
More informationFinding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation
Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation Fredrik Johansson* 1 Manuel Kauers* 1 Marc Mezzarobba* 1,2 *RISC-Linz ISSAC 2013, Boston, MA 1 Supported by the Austrian Science
More informationThe following can also be obtained from this WWW address: the papers [8, 9], more examples, comments on the implementation and a short description of
An algorithm for computing the Weierstrass normal form Mark van Hoeij Department of mathematics University of Nijmegen 6525 ED Nijmegen The Netherlands e-mail: hoeij@sci.kun.nl April 9, 1995 Abstract This
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationJ. Symbolic Computation (1995) 11, 1{000 An algorithm for computing an integral basis in an algebraic function eld Mark van Hoeij Department of mathem
J. Symbolic Computation (1995) 11, 1{000 An algorithm for computing an integral basis in an algebraic function eld Mark van Hoeij Department of mathematics University of Nijmegen 6525 ED Nijmegen The Netherlands
More informationAlgorithmic Lie Symmetry Analysis and Group Classication for Ordinary Dierential Equations
dmitry.lyakhov@kaust.edu.sa Symbolic Computations May 4, 2018 1 / 25 Algorithmic Lie Symmetry Analysis and Group Classication for Ordinary Dierential Equations Dmitry A. Lyakhov 1 1 Computational Sciences
More informationFinal Exam C Name i D) 2. Solve the equation by factoring. 4) x2 = x + 72 A) {1, 72} B) {-8, 9} C) {-8, -9} D) {8, 9} 9 ± i
Final Exam C Name First, write the value(s) that make the denominator(s) zero. Then solve the equation. 7 ) x + + 3 x - = 6 (x + )(x - ) ) A) No restrictions; {} B) x -, ; C) x -; {} D) x -, ; {2} Add
More informationMotivation Automatic asymptotics and transseries Asymptotics of non linear phenomena. Systematic theorie. Eective theory ) emphasis on algebraic aspec
Introduction to automatic asymptotics by Joris van der Hoeven CNRS Universite d'orsay, France email: vdhoeven@math.u-psud.fr web: http://ultralix.polytechnique.fr/~vdhoeven MSRI, Berkeley, 6-0-998 Motivation
More informationSolutions of exercise sheet 6
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 6 1. (Irreducibility of the cyclotomic polynomial) Let n be a positive integer, and P Z[X] a monic irreducible factor of X n 1
More informationNormal integral bases for Emma Lehmer s parametric family of cyclic quintics
Journal de Théorie des Nombres de Bordeaux 16 (004), 15 0 Normal integral bases for Emma Lehmer s parametric family of cyclic quintics par Blair K. SPEARMAN et Kenneth S. WILLIAMS Résumé. Nous donnons
More informationPolynomials. Chapter 4
Chapter 4 Polynomials In this Chapter we shall see that everything we did with integers in the last Chapter we can also do with polynomials. Fix a field F (e.g. F = Q, R, C or Z/(p) for a prime p). Notation
More information. Consider the linear system dx= =! = " a b # x y! : (a) For what values of a and b do solutions oscillate (i.e., do both x(t) and y(t) pass through z
Preliminary Exam { 1999 Morning Part Instructions: No calculators or crib sheets are allowed. Do as many problems as you can. Justify your answers as much as you can but very briey. 1. For positive real
More informationTHE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - SPRING SESSION ADVANCED ALGEBRA II.
THE JOHNS HOPKINS UNIVERSITY Faculty of Arts and Sciences FINAL EXAM - SPRING SESSION 2006 110.402 - ADVANCED ALGEBRA II. Examiner: Professor C. Consani Duration: 3 HOURS (9am-12:00pm), May 15, 2006. No
More informationFinal Exam A Name. 20 i C) Solve the equation by factoring. 4) x2 = x + 30 A) {-5, 6} B) {5, 6} C) {1, 30} D) {-5, -6} -9 ± i 3 14
Final Exam A Name First, write the value(s) that make the denominator(s) zero. Then solve the equation. 1 1) x + 3 + 5 x - 3 = 30 (x + 3)(x - 3) 1) A) x -3, 3; B) x -3, 3; {4} C) No restrictions; {3} D)
More informationTest 2 Review Math 1111 College Algebra
Test 2 Review Math 1111 College Algebra 1. Begin by graphing the standard quadratic function f(x) = x 2. Then use transformations of this graph to graph the given function. g(x) = x 2 + 2 *a. b. c. d.
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationMahler measure as special values of L-functions
Mahler measure as special values of L-functions Matilde N. Laĺın Université de Montréal mlalin@dms.umontreal.ca http://www.dms.umontreal.ca/~mlalin CRM-ISM Colloquium February 4, 2011 Diophantine equations
More informationLiouvillian solutions of third order differential equations
Article Submitted to Journal of Symbolic Computation Liouvillian solutions of third order differential equations Felix Ulmer IRMAR, Université de Rennes, 0 Rennes Cedex, France felix.ulmer@univ-rennes.fr
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Calculus I - Homework Chapter 2 Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Determine whether the graph is the graph of a function. 1) 1)
More information1 Holomorphic functions
Robert Oeckl CA NOTES 1 15/09/2009 1 1 Holomorphic functions 11 The complex derivative The basic objects of complex analysis are the holomorphic functions These are functions that posses a complex derivative
More informationRamanujan s first letter to Hardy: 5 + = 1 + e 2π 1 + e 4π 1 +
Ramanujan s first letter to Hardy: e 2π/ + + 1 = 1 + e 2π 2 2 1 + e 4π 1 + e π/ 1 e π = 2 2 1 + 1 + e 2π 1 + Hardy: [These formulas ] defeated me completely. I had never seen anything in the least like
More informationIntroduction and mathematical preliminaries
Chapter Introduction and mathematical preliminaries Contents. Motivation..................................2 Finite-digit arithmetic.......................... 2.3 Errors in numerical calculations.....................
More informationPermuting the partitions of a prime
Journal de Théorie des Nombres de Bordeaux 00 (XXXX), 000 000 Permuting the partitions of a prime par Stéphane VINATIER Résumé. Étant donné un nombre premier p impair, on caractérise les partitions l de
More informationA Course in Computational Algebraic Number Theory
Henri Cohen 2008 AGI-Information Management Consultants May be used for personal purporses only or by libraries associated to dandelon.com network. A Course in Computational Algebraic Number Theory Springer
More informationExact Arithmetic on a Computer
Exact Arithmetic on a Computer Symbolic Computation and Computer Algebra William J. Turner Department of Mathematics & Computer Science Wabash College Crawfordsville, IN 47933 Tuesday 21 September 2010
More informationMath /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined
Math 400-001/Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined using limits. As a particular case, the derivative of f(x)
More informationAn Additive Characterization of Fibers of Characters on F p
An Additive Characterization of Fibers of Characters on F p Chris Monico Texas Tech University Lubbock, TX c.monico@ttu.edu Michele Elia Politecnico di Torino Torino, Italy elia@polito.it January 30, 2009
More informationThe Inverse Galois Problem David P. Roberts University of Minnesota, Morris
The Inverse Galois Problem David P. Roberts University of Minnesota, Morris 1. Polynomials, fields, and their invariants: A degree n number field K has a discriminant D Z and a Galois group G S n. 2. The
More informationCounterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co
Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is
More informationMock Final Exam Name. Solve and check the linear equation. 1) (-8x + 8) + 1 = -7(x + 3) A) {- 30} B) {- 6} C) {30} D) {- 28}
Mock Final Exam Name Solve and check the linear equation. 1) (-8x + 8) + 1 = -7(x + 3) 1) A) {- 30} B) {- 6} C) {30} D) {- 28} First, write the value(s) that make the denominator(s) zero. Then solve the
More informationSection 0.2 & 0.3 Worksheet. Types of Functions
MATH 1142 NAME Section 0.2 & 0.3 Worksheet Types of Functions Now that we have discussed what functions are and some of their characteristics, we will explore different types of functions. Section 0.2
More informationMath 121 Homework 2 Solutions
Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationExponential Functions Dr. Laura J. Pyzdrowski
1 Names: (4 communication points) About this Laboratory An exponential function is an example of a function that is not an algebraic combination of polynomials. Such functions are called trancendental
More informationINTRODUCTION TO REAL ANALYTIC GEOMETRY
INTRODUCTION TO REAL ANALYTIC GEOMETRY KRZYSZTOF KURDYKA 1. Analytic functions in several variables 1.1. Summable families. Let (E, ) be a normed space over the field R or C, dim E
More information#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT
#A5 INTEGERS 8A (208) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT Yann Bugeaud IRMA, UMR 750, Université de Strasbourg et CNRS, Strasbourg, France bugeaud@math.unistra.fr
More informationPolynomials with nontrivial relations between their roots
ACTA ARITHMETICA LXXXII.3 (1997) Polynomials with nontrivial relations between their roots by John D. Dixon (Ottawa, Ont.) 1. Introduction. Consider an irreducible polynomial f(x) over a field K. We are
More informationChapter 11. Taylor Series. Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27
Chapter 11 Taylor Series Josef Leydold Mathematical Methods WS 2018/19 11 Taylor Series 1 / 27 First-Order Approximation We want to approximate function f by some simple function. Best possible approximation
More informationFast algorithms for polynomials and matrices Part 6: Polynomial factorization
Fast algorithms for polynomials and matrices Part 6: Polynomial factorization by Grégoire Lecerf Computer Science Laboratory & CNRS École polytechnique 91128 Palaiseau Cedex France 1 Classical types of
More informationHurwitz Number Fields David P. Roberts University of Minnesota, Morris. 1. Context coming from mass formulas
Hurwitz Number Fields David P. Roberts University of Minnesota, Morris. Context coming from mass formulas. Sketch of definitions and key properties. A full Hurwitz number field with Galois group A 5 and
More informationMath 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d
Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).
More informationComputing Monodromy via Continuation Methods on Random Riemann Surfaces
Computing Monodromy via Continuation Methods on Random Riemann Surfaces André Galligo, Adrien Poteaux To cite this version: André Galligo, Adrien Poteaux. Computing Monodromy via Continuation Methods on
More informationAn Introduction to Differential Algebra
An Introduction to Differential Algebra Alexander Wittig1, P. Di Lizia, R. Armellin, et al. 1 ESA Advanced Concepts Team (TEC-SF) SRL, Milan Dinamica Outline 1 Overview Five Views of Differential Algebra
More informationIntroduction to Number Fields David P. Roberts University of Minnesota, Morris
Introduction to Number Fields David P. Roberts University of Minnesota, Morris 1. The factpat problem 2. Polynomial discriminants 3. Global factorizations 4. Generic factorization statistics 5. Resolvents
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationSOME FIFTH ROOTS THAT ARE CONSTRUCTIBLE BY MARKED RULER AND COMPASS
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 3, 2016 SOME FIFTH ROOTS THAT ARE CONSTRUCTIBLE BY MARKED RULER AND COMPASS ELLIOT BENJAMIN AND C. SNYDER ABSTRACT. We show that there are cubic
More informationComputing the Abel map
Computing the Abel map Bernard Deconinck Matthew S. Patterson bernard@amath.washington.edu mpatters@amath.washington.edu Department of Applied Mathematics University of Washington Seattle, WA 98195-2420
More informationChebyshev covers and exceptional number fields David P. Roberts University of Minnesota, Morris
Chebyshev covers and exceptional number fields David P. Roberts University of Minnesota, Morris 1. Context. A heuristic says that A N or S N number fields with discriminant ±2 a 5 b and degree N 49 need
More informationMAT 535 Problem Set 5 Solutions
Final Exam, Tues 5/11, :15pm-4:45pm Spring 010 MAT 535 Problem Set 5 Solutions Selected Problems (1) Exercise 9, p 617 Determine the Galois group of the splitting field E over F = Q of the polynomial f(x)
More informationMAT 107 College Algebra Fall 2013 Name. Final Exam, Version X
MAT 107 College Algebra Fall 013 Name Final Exam, Version X EKU ID Instructor Part 1: No calculators are allowed on this section. Show all work on your paper. Circle your answer. Each question is worth
More informationALGEBRAIC GEOMETRY HOMEWORK 3
ALGEBRAIC GEOMETRY HOMEWORK 3 (1) Consider the curve Y 2 = X 2 (X + 1). (a) Sketch the curve. (b) Determine the singular point P on C. (c) For all lines through P, determine the intersection multiplicity
More informationPar Joris van der Hoeven. : LIX, Ecole polytechnique, France. Web :
On systems of multivariate power series equations Par Joris van der Hoeven Lab. : LIFL, Universite de Lille I, France : LIX, Ecole polytechnique, France Email: vdhoeven@lix.polytechnique.fr Web : http://lix.polytechnique.fr:0/vdhoeven/
More informationSolutions Preliminary Examination in Numerical Analysis January, 2017
Solutions Preliminary Examination in Numerical Analysis January, 07 Root Finding The roots are -,0, a) First consider x 0 > Let x n+ = + ε and x n = + δ with δ > 0 The iteration gives 0 < ε δ < 3, which
More informationOn The Weights of Binary Irreducible Cyclic Codes
On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:
More informationCandidates are expected to have available a calculator. Only division by (x + a) or (x a) will be required.
Revision Checklist Unit C2: Core Mathematics 2 Unit description Algebra and functions; coordinate geometry in the (x, y) plane; sequences and series; trigonometry; exponentials and logarithms; differentiation;
More informationHurwitz Number Fields David P. Roberts, U. of Minnesota, Morris Akshay Venkatesh, Stanford University
Hurwitz Number Fields David P. Roberts, U. of innesota, orris Akshay Venkatesh, Stanford University Notation: NF m (P) is the set of isomorphism classes of degree m number fields ramified only within P
More informationExact Computation of the Real Solutions of Arbitrary Polynomial Systems
Exact Computation of the Real Solutions of Arbitrary Polynomial Systems Presented by Marc Moreno Maza 1 joint work with Changbo Chen 1, James H. Davenport 2, François Lemaire 3, John P. May 5, Bican Xia
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationy2 + 4y - 5 c a + b 27 i C) ) (16, ) B) (16 3 3, )
MAT 107 Final, Version A, Spring 2008 1) If (4, 4) is the endpoint of a line segment, and (2, 1) is its midpoint, find the other endpoint. A) (0, 7) B) (-2, 0) C) (8, 10) D) (0, -2) 2) Solve for x: A)
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationMathematics for Economics ECON MA/MSSc in Economics-2017/2018. Dr. W. M. Semasinghe Senior Lecturer Department of Economics
Mathematics for Economics ECON 53035 MA/MSSc in Economics-2017/2018 Dr. W. M. Semasinghe Senior Lecturer Department of Economics MATHEMATICS AND STATISTICS LERNING OUTCOMES: By the end of this course unit
More informationMath 2: Algebra 2, Geometry and Statistics Ms. Sheppard-Brick Chapter 4 Test Review
Chapter 4 Test Review Students will be able to (SWBAT): Write an explicit and a recursive function rule for a linear table of values. Write an explicit function rule for a quadratic table of values. Determine
More information2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene
Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based
More informationA new attack on RSA with a composed decryption exponent
A new attack on RSA with a composed decryption exponent Abderrahmane Nitaj and Mohamed Ould Douh,2 Laboratoire de Mathématiques Nicolas Oresme Université de Caen, Basse Normandie, France abderrahmane.nitaj@unicaen.fr
More informationUniversità degli studi di Pisa. PhD Thesis. Effective Estimates for Coverings of Curves over Number Fields
Università degli studi di Pisa Dipartimento di Matematica PhD Thesis Effective Estimates for Coverings of Curves over Number Fields Advisors : Prof. Yuri Bilu, Prof. Roberto Dvornicich Candidate: Marco
More informationElliptic curves and modularity
Elliptic curves and modularity For background and (most) proofs, we refer to [1]. 1 Weierstrass models Let K be any field. For any a 1, a 2, a 3, a 4, a 6 K consider the plane projective curve C given
More informationAlgebra II CP Final Exam Review Packet. Calculator Questions
Name: Algebra II CP Final Exam Review Packet Calculator Questions 1. Solve the equation. Check for extraneous solutions. (Sec. 1.6) 2 8 37 2. Graph the inequality 31. (Sec. 2.8) 3. If y varies directly
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
More informationPower series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) a n z n. n=0
Lecture 22 Power series solutions for 2nd order linear ODE s (not necessarily with constant coefficients) Recall a few facts about power series: a n z n This series in z is centered at z 0. Here z can
More informationLecture 10 Polynomial interpolation
Lecture 10 Polynomial interpolation Weinan E 1,2 and Tiejun Li 2 1 Department of Mathematics, Princeton University, weinan@princeton.edu 2 School of Mathematical Sciences, Peking University, tieli@pku.edu.cn
More information(3) Let Y be a totally bounded subset of a metric space X. Then the closure Y of Y
() Consider A = { q Q : q 2 2} as a subset of the metric space (Q, d), where d(x, y) = x y. Then A is A) closed but not open in Q B) open but not closed in Q C) neither open nor closed in Q D) both open
More informationSalem numbers of trace 2 and a conjecture of Estes and Guralnick
Salem numbers of trace 2 and a conjecture of Estes and Guralnick James McKee, Pavlo Yatsyna (Royal Holloway) November 2015 Properties of minimal polynomials Let A be an integer symmetric matrix, n n. Properties
More informationbut no smaller power is equal to one. polynomial is defined to be
13. Radical and Cyclic Extensions The main purpose of this section is to look at the Galois groups of x n a. The first case to consider is a = 1. Definition 13.1. Let K be a field. An element ω K is said
More informationOn Newton-Raphson iteration for multiplicative inverses modulo prime powers
On Newton-Raphson iteration for multiplicative inverses modulo prime powers Jean-Guillaume Dumas To cite this version: Jean-Guillaume Dumas. On Newton-Raphson iteration for multiplicative inverses modulo
More informationMath Practice Exam 3 - solutions
Math 181 - Practice Exam 3 - solutions Problem 1 Consider the function h(x) = (9x 2 33x 25)e 3x+1. a) Find h (x). b) Find all values of x where h (x) is zero ( critical values ). c) Using the sign pattern
More informationPade Approximations and the Transcendence
Pade Approximations and the Transcendence of π Ernie Croot March 9, 27 1 Introduction Lindemann proved the following theorem, which implies that π is transcendental: Theorem 1 Suppose that α 1,..., α k
More informationHonors Advanced Algebra Unit 3: Polynomial Functions November 9, 2016 Task 11: Characteristics of Polynomial Functions
Honors Advanced Algebra Name Unit 3: Polynomial Functions November 9, 2016 Task 11: Characteristics of Polynomial Functions MGSE9 12.F.IF.7 Graph functions expressed symbolically and show key features
More informationImplementation of Theorems in D.S. Dummit s Solving Solvable Quintics(1991)
Implementation of Theorems in D.S. Dummit s Solving Solvable Quintics(1991) Matthew Moore June 0, 005 Abstract In D.S. Dummit s 1991 paper, Solving Solvable Quintics, two theorems are introduced. The first
More informationComputing Limits of Real Multivariate Rational Functions
Computing Limits of Real Multivariate Rational Functions Parisa Alvandi, Mahsa Kazemi, Marc Moreno Maza Western University, Canada July 22, 2016 Outline 1 Statement of the problem and previous works 2
More informationDegree Master of Science in Mathematical Modelling and Scientific Computing Mathematical Methods I Thursday, 12th January 2012, 9:30 a.m.- 11:30 a.m.
Degree Master of Science in Mathematical Modelling and Scientific Computing Mathematical Methods I Thursday, 12th January 2012, 9:30 a.m.- 11:30 a.m. Candidates should submit answers to a maximum of four
More informationSection Properties of Rational Expressions
88 Section. - Properties of Rational Expressions Recall that a rational number is any number that can be written as the ratio of two integers where the integer in the denominator cannot be. Rational Numbers:
More informationComputational Formal Resolution of Surfaces in P 3 C
Computational Formal Resolution of Surfaces in P 3 C {Tobias.Beck Josef.Schicho}@oeaw.ac.at RICAM-Linz Austrian Academy of Sciences July 31 / Magma 2006 Berlin T. Beck, J. Schicho (RICAM-Linz) Computational
More informationIn class midterm Exam - Answer key
Fall 2013 In class midterm Exam - Answer key ARE211 Problem 1 (20 points). Metrics: Let B be the set of all sequences x = (x 1,x 2,...). Define d(x,y) = sup{ x i y i : i = 1,2,...}. a) Prove that d is
More information1. If 1, ω, ω 2, -----, ω 9 are the 10 th roots of unity, then (1 + ω) (1 + ω 2 ) (1 + ω 9 ) is A) 1 B) 1 C) 10 D) 0
4 INUTES. If, ω, ω, -----, ω 9 are the th roots of unity, then ( + ω) ( + ω ) ----- ( + ω 9 ) is B) D) 5. i If - i = a + ib, then a =, b = B) a =, b = a =, b = D) a =, b= 3. Find the integral values for
More informationARCS IN FINITE PROJECTIVE SPACES. Basic objects and definitions
ARCS IN FINITE PROJECTIVE SPACES SIMEON BALL Abstract. These notes are an outline of a course on arcs given at the Finite Geometry Summer School, University of Sussex, June 26-30, 2017. Let K denote an
More informationx x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)
Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)
More informationExp, Log, Poly Functions Quarter 3 Review Name
Exp, Log, Poly Functions Quarter 3 Review Name Textbook problems for practice: p. 285-293; p. 293 #9-14, p. 294-5 #1-34, 49-52, 55,56, 57; p. 297-321 logs; p. 280-1 #11-84 *Blood Alcohol, Bungee-from binder
More informationSums of Consecutive Perfect Powers is Seldom a Perfect Power
Sums of Consecutive Perfect Powers is Seldom a Perfect Power Journées Algophantiennes Bordelaises 2017, Université de Bordeaux June 7, 2017 A Diophantine Equation Question x k + (x + 1) k + + (x + d 1)
More informationQUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday September 21, 2004 (Day 1)
QUALIFYING EXAMINATION Harvard University Department of Mathematics Tuesday September 21, 2004 (Day 1) Each of the six questions is worth 10 points. 1) Let H be a (real or complex) Hilbert space. We say
More informationFunctions. A function is a rule that gives exactly one output number to each input number.
Functions A function is a rule that gives exactly one output number to each input number. Why it is important to us? The set of all input numbers to which the rule applies is called the domain of the function.
More informationResults and open problems related to Schmidt s Subspace Theorem. Jan-Hendrik Evertse
Results and open problems related to Schmidt s Subspace Theorem Jan-Hendrik Evertse Universiteit Leiden 29 ièmes Journées Arithmétiques July 6, 2015, Debrecen Slides can be downloaded from http://pub.math.leidenuniv.nl/
More informationMultivariate polynomial approximation and convex bodies
Multivariate polynomial approximation and convex bodies Outline 1 Part I: Approximation by holomorphic polynomials in C d ; Oka-Weil and Bernstein-Walsh 2 Part 2: What is degree of a polynomial in C d,
More information1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.
Math120 - Precalculus. Final Review. Fall, 2011 Prepared by Dr. P. Babaali 1 Algebra 1. Use the properties of exponents to simplify the following expression, writing your answer with only positive exponents.
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationMATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11
MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of
More information18. Cyclotomic polynomials II
18. Cyclotomic polynomials II 18.1 Cyclotomic polynomials over Z 18.2 Worked examples Now that we have Gauss lemma in hand we can look at cyclotomic polynomials again, not as polynomials with coefficients
More informationON THE CONTINUED FRACTION EXPANSION OF THE UNIQUE ROOT IN F(p) OF THE EQUATION x 4 + x 2 T x 1/12 = 0 AND OTHER RELATED HYPERQUADRATIC EXPANSIONS
ON THE CONTINUED FRACTION EXPANSION OF THE UNIQUE ROOT IN F(p) OF THE EQUATION x 4 + x 2 T x 1/12 = 0 AND OTHER RELATED HYPERQUADRATIC EXPANSIONS by A. Lasjaunias Abstract.In 1986, Mills and Robbins observed
More information