Diagonals of rational functions
|
|
- Elmer May
- 7 years ago
- Views:
Transcription
1 Diagonals of rational functions Main Conference of Chaire J Morlet Artin approximation and infinite dimensional geometry 27 mars 2015 Pierre Lairez TU Berlin
2 Diagonals: definitions and properties Binomial sums Computing diagonals Diagonals: definitions and properties Binomial sums Computing diagonals
3 Diagonal of a power series Définition f = a i1,,i n x i1 1 x i n n Q x 1,,x n i 1,,i n N n diag f def = a i,,i t i i 0
4 A combinatorial problem Counting rook paths y (7, 10) 7 a i,j def = nb of rook paths from (0,0) to (i,j) Easy recurrence: a i,j = a k,j + k <i k <j a i,k (0,0) 2 1 x What about a n,n? asymptotic? existence of a recurrence?
5 Recurrence relations for rook paths dimension 2 9nu n ( n)u n+1 + (2 + n)u n+2 = 0 dimension 3 192n 2 (1 + n)( n)u n +(1 + n)( n n n 3 )u n+1 (2 + n)( n n n 3 )u n+2 +2(2 + n)(3 + n) 2 ( n)u n+3 = 0 dimension n 3 (1 + n) 2 ( n n n n 4 )u n (1 + n) 2 ( n n n 7 )u n+1 +2(2 + n)( n n n 8 )u n+2 (3 + n) 2 ( n n n 7 )u n+3 +2(3 + n) 2 (4 + n) 3 ( n n n n 4 )u n+4 = 0
6 Differential equation for diagonals a i,j = a k,j + a i,k a i,j x i y j = k <i k <j i,j 0 n 0 a n,n t n = diag 1 1 x 1 x y 1 y 1 1 x 1 x y 1 y Theorem (Lipshitz 1988) diagonal differentially finite If R Q(x 1,,x n ) Q x 1,,x n, then diag R satisfies a linear differential equation with polynomial coefficients c r (t)y (r ) + + c 1 (t)y + c 0 (t)y = 0
7 More properties of diagonals Theorem (Furstenberg 1967) algebraic diagonal If f (t) = a n t n is an algebraic series (ie P(t, f (t)) = 0 for some P Q[x,y]), then it is the diagonal of a rational power series Theorem (Furstenberg 1967) diagonal algebraic mod p If a n t n Q t is the diagonal of a rational power series, then it is an algebraic series modulo p for almost all prime p
8 Algebricity modulo p Example f = n ( (3n)! n! 3 tn = diag 1 1 x y z ) is not algebraic f (1 + t) 1 4 mod 5 f ( 1 + 6t + 6t 2) 1 6 mod 7 f ( 1 + 6t + 2t 2 + 8t 3) 1 10 mod 11 Besides, ( 27t 2 t ) f + (54t 1)f + 6f = 0
9 Proof of algebricity modulo p F q, the base field Slicing operators For r Z, E r i a i t i def = i a qi+r t i and E r I a I x I def = a qi+(r,,r ) x I I We check diag E r = E r diag ; x i E r (F) = E r (x q i F) ; G(x)E r (F) = E r (G(x) q F), because G(x q ) = G(x) q, where x q = x q 1,,xq n; If f (t) = i a i t i, then f (t) = 0 r <q t r i a qi+r t qi
10 Proof of algebricity modulo p F q, the base field Slicing operators For r Z, E r i We check a i t i def = diag E r = E r diag ; x i E r (F) = E r (x q i F) ; i a qi+r t i and E r I a I x I def = G(x)E r (F) = E r (G(x) q F), because G(x q ) = G(x) q, where x q = x q 1,,xq n; If f (t) = i a i t i, then a qi+(r,,r ) x I I f (t) = 0 r <q t r i a qi+r t i q
11 Proof of algebricity modulo p F q, the base field Slicing operators For r Z, E r i a i t i def = i a qi+r t i and E r I a I x I def = a qi+(r,,r ) x I I We check diag E r = E r diag ; x i E r (F) = E r (x q i F) ; G(x)E r (F) = E r (G(x) q F), because G(x q ) = G(x) q, where x q = x q 1,,xq n; If f (t) = i a i t i, then f (t) = 0 r <q t r E r (f ) q
12 Proof of algebricity modulo p Let R = A F F q(x), d = max(deg A,deg F) and the F q -vector space V = { diag ( ) P deg P d } ( ( F F q t dim V d+n )) n 1 Operators E r stabilize V Proof ( ) P PF E r diag = diag E q 1 F r F q = diag E r (PF q 1 ) V F
13 Proof of algebricity modulo p Let R = A F F q(x), d = max(deg A,deg F) and the F q -vector space V = { diag ( ) P deg P d } ( ( F F q t dim V d+n )) n 1 Operators E r stabilize V 2 Let f 1,, f s be a basis of V There exist c ij F q [t] such that i, f i = c ij f q j Proof f i = 0 r <q ( = j t r E r (f i ) q = 0 r <q j b ij t r ) f q j 0 r <q t r ( j b ij f j ) q
14 Proof of algebricity modulo p Let R = A F F q(x), d = max(deg A,deg F) and the F q -vector space V = { diag ( ) P deg P d } ( ( F F q t dim V d+n )) n 1 Operators E r stabilize V 2 Let f 1,, f s be a basis of V There exist c ij F q [t] such that i, f i = c ij f q j j 3 All the elements of V are algebraic Proof i, f q i = j cq ij f q2 j, etc { Thus, over F q (t), Vect (R) } qk 0 k s } Vect {f qk i 0 k s, 1 i s Vect { f qs i 1 i s}
15 Characterization of diagonals? Conjecture (Christol 1990) integer coefficients + convergent + diff finite diagonal If a n t n Z t, has radius of convergence > 0, and satisfies a linear differential equation with polynomial coefficients, then it is the diagonal of a rational power series A hierarchy of power series For f Q t, let N(f ) be the minimum number of variables x 1,,x N(f ) such that f = diag R(x 1,,x N(f ) ), with R rational power series, if any N(f ) = 1 f is rational N(f ) = 2 f is algebraic irrational ( ) N n (3n)! t n = 3 n! 3 Question : Find a f such that 3 < N(f ) <
16 Diagonals: definitions and properties Binomial sums Computing diagonals Diagonals: definitions and properties Binomial sums Computing diagonals
17 Binomial sums Examples 2n k=0 n ( ) 2 ( ) 2 n n + k = k k k=0 n i=0 j=0 ( ) 3 2n ( 1) k = ( 1) n (3n)! k (n!) 3 k=0 ( n k ) ( ) k n + k k j=0 n ( ) 2 ( ) i + j 4n 2i 2j = (2n + 1) i 2n 2i ( 1) ( ) ( n+r +s n n r s r 0 s 0 ) ( n+s s ) ( n+r r (Dixon) ( ) 3 k (Strehl) j ( ) 2 2n n ) ( 2n r s ) ( n = n 4 k) k 0
18 Binomial sums Further examples Number theory n 3 u n + (n 1) 3 u n 2 = (34n 3 51n n 5)u n 1 n ( ) 2 ( ) 2 n n + k avec u n = (Apéry) k k k=0 Important step in proving that ζ(3) = n 1 1 n 3 Analysis of algorithm Q [50] Develop computer programs for simplifying sums that involve binomial coefficients Exercise The Art of Computer Programming Knuth (1968)
19 Definition δ : Z Q is a binomial sum (δ 0 = 1 et δ n = 0 si n 0) n Z a n Q is a binomial sum for all a Q (n,k) Z 2 ( n k) Q is a binomial sum If u,v : Z p Q are bs, then u + v and uv are bs If u : Z p Q are bs and λ : Z p Z q is an affine map, then u λ is a bs If u : Z p Q is a bs, then n 1 (n 1,,n p ) Z p k=0 u k,n2,,n p Q is a bs
20 Diagonals binomial sums Theorem (Bosta, Lairez, Salvy 2014) A sequence (u n ) n 0 is a binomial sum if and only if its generating function u n t n is the diagonal of a rational series Example n n 0 k=0 ( n k ) 2 ( n+k k ) 2 ( t n = diag 1 (1 x 1 )(1 x 2 )(1 x 3 ) x 4 (x 1 +x 2 x 3 x 1 x 2 x 3 ) )
21 Corollaries Corollary 1 binomial sum recurrence If (u n ) n 0 is a binomial sum, then it satisfies a linear recurrence with polynomial coefficients Corollary 2 algebraic gf binomial sum If u n t n is an algebraic series then (u n ) n 0 is a binomial sum Corollary 3 binomial sum algebraic gf mod p If (u n ) n 0 is a binomial sum, then u n t n is an algebraic series modulo p for almost all prime p Conjecture integral + exp bounded + recurrence binomial sum If (u n ) n 0 Z N grows at most exponentially and satisfies a linear recurrence with polynomial coefficients, then it is a binomial sum
22 Binomial sums as diagonals Skectch of the proof Proposition All binomial sums are linear combinations of sequences in the form (k 1,,k p ) Z p [1] ( R 0 R k 1 1 R k ) d d, where R 0,,R p Q(x 1,,x d ) With one variable, [1] (RS n ) = [x1 n xn d+1 ]( R ) 1 x 1 x d+1 S } {{ } may not be a power series
23 Diagonals as binomial sums Skectch of the proof Let R = 1 + a 1 x m x m Q(x 1,,x d ) r ( ) R = x m k1 + + k 0 r a k 1 k k N r 1,,k 1 ak r r x k 1m 1 x k r m r r } {{ } ( k1 + +k r k 1,,k r x m 0 ) = ( k1 + +k r binomial sum [x n 1 xn d ]R = k 1 C k ) ( k2 + +k r k 2 k Z e C k 1 Γ (n,k) où ) ( kr ) 1 +k r k r, so Ck is a Γ = { e (n,k) R R e + m 0 + k i m i = (n,,n) } i=1
24 Diagonals: definitions and properties Binomial sums Computing diagonals Diagonals: definitions and properties Binomial sums Computing diagonals
25 Algorithmic Lipshitz theorem Theorem (Lipshitz 1988) diagonal differentially finite If R Q(x 1,,x n ) Q x 1,,x n, then diag R satisfies a linear differential equation with polynomial coefficients c r (t)y (r ) + + c 1 (t)y + c 0 (t)y = 0 How to compute the differential equation? Once computer, we get everything we want about the diagonal It would allow to prove identities between binomial sums
26 Diagonals as integrals Basic fact: C, diag ( x i C x i x j C x j ) = 0 Consider the following transformation T : Q(x 1,,x n ) Q(t,x 1,,x n 1 ) ( ) 1 t R R x 1,,x n 1, x 1 x n 1 x 1 x n 1 T (R) = n 1 i=1 diag R = 1 (2iπ) n C i diag R = 0 x i T (R)dx 1 dx n 1
27 Computing integrals K a field of characteristic 0 with a derivation δ (usually K = Q(t) and δ = t ) R = a f K(x 1,,x n ) Problem Find c 0,,c r K such that C 1,,C n K(x) c r δ r (R) + + c 1 δ(r) + c 0 (R) = n i=1 C i x i Problem (bis) Compute a basis and normal forms in K(x 1,,x n )/ n i=1 x i K(x 1,,x n )
28 Computing integrals K a field of characteristic 0 with a derivation δ (usually K = Q(t) and δ = t ) R = a f K(x 1,,x n ) Problem Find c 0,,c r K such that C 1,,C n K(x) c r δ r (R) + + c 1 δ(r) + c 0 (R) = n i=1 C i x i Problem (bis) Compute a basis and normal forms in K[x 1,,x n, f 1 ]/ =: H n Rham (An K n i=1 x i K[x 1,,x n, f 1 ] \ V(f )) Hn 1 Rham (V(f ))
29 Finiteness of the de Rham cohomology Theorem (Grothendieck 1966) H n Rham (An K \ V(f )) is a finite dimensional K-vector space Theorem (Griffiths 1969) dim K H n Rham (An K \ V(f )) < (deg f + 1)n Corollary The diagonal of R(x 0,,x n ) is solution of a linear differential equation with polynomial coefficients of order at most (d + 1) n, where d is the degree of the denominator of T (R)
30 Reduction of pole order Homogeneous case f K[x 0,,x n ] homogeneous def V f = { a f homogeneous of degree n 1 } q def Notation : i = x i c Fact : i f q 1 = ic f q 1 (q 1)c i f f q Rewriting rule i c i i f f q 1 q 1 i i c i f q 1 (maps V f V f ) Theorem (Griffiths 1969) If V(f ) P n K is smooth then a f q V a f, f q = c i i f s a f q 0 i
31 Reduction of pole order Homogeneous singular case Rewriting rules are ambiguous: if i c i i f = 0, then 0 i i c i f q We can add the rules i i c i 0, it still preserves equivalence classes modulo derivatives New reductions 0 rk r b f appear, we add the rules b rk r + 1 q f 0 q f q rg 2 Theorem There exists an r > 0 such that for all a f q V f a f q V f, a f q = i i c i f s a f q rk r 0 Leads to an efficient algorithm for computing rational integrals (Lairez 2015)
32 An example f = 2xyz(w x)(w y)(w z) w 3 (w 3 w 2 z + xyz) e(q,r) : number of indepedent rational functions a/f q that are not reducible with rules of rank r q q > 4 no rule q 3 e(q, 1) q e(q, 2) e(q, 3) dim H 3 (P 3 \ V(f )) = 10
Discrete Mathematics: Homework 7 solution. Due: 2011.6.03
EE 2060 Discrete Mathematics spring 2011 Discrete Mathematics: Homework 7 solution Due: 2011.6.03 1. Let a n = 2 n + 5 3 n for n = 0, 1, 2,... (a) (2%) Find a 0, a 1, a 2, a 3 and a 4. (b) (2%) Show that
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 information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
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 informationRow 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 informationVERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationUnique Factorization
Unique Factorization Waffle Mathcamp 2010 Throughout these notes, all rings will be assumed to be commutative. 1 Factorization in domains: definitions and examples In this class, we will study the phenomenon
More informationBounds For the Effective Nullstellensatz Ideals in Italy
Bounds for the Hilbert Function of Polynomial Ideals and for the Degrees in the Nullstellensatz Martín Sombra 1 Departamento de Matemática, Facultad de Ciencias Exactas, Universidad de Buenos Aires, 1428
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 informationMA106 Linear Algebra lecture notes
MA106 Linear Algebra lecture notes Lecturers: Martin Bright and Daan Krammer Warwick, January 2011 Contents 1 Number systems and fields 3 1.1 Axioms for number systems......................... 3 2 Vector
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
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 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 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 informationDegree Bounds for Gröbner Bases in Algebras of Solvable Type
Degree Bounds for Gröbner Bases in Algebras of Solvable Type Matthias Aschenbrenner University of California, Los Angeles (joint with Anton Leykin) Algebras of Solvable Type... introduced by Kandri-Rody
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 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 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 informationBANACH AND HILBERT SPACE REVIEW
BANACH AND HILBET SPACE EVIEW CHISTOPHE HEIL These notes will briefly review some basic concepts related to the theory of Banach and Hilbert spaces. We are not trying to give a complete development, but
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 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 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 informationSINTESI DELLA TESI. Enriques-Kodaira classification of Complex Algebraic Surfaces
Università degli Studi Roma Tre Facoltà di Scienze Matematiche, Fisiche e Naturali Corso di Laurea Magistrale in Matematica SINTESI DELLA TESI Enriques-Kodaira classification of Complex Algebraic Surfaces
More informationPROBLEM SET 6: POLYNOMIALS
PROBLEM SET 6: POLYNOMIALS 1. introduction In this problem set we will consider polynomials with coefficients in K, where K is the real numbers R, the complex numbers C, the rational numbers Q or any other
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
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 informationCollege Algebra - MAT 161 Page: 1 Copyright 2009 Killoran
College Algebra - MAT 6 Page: Copyright 2009 Killoran Zeros and Roots of Polynomial Functions Finding a Root (zero or x-intercept) of a polynomial is identical to the process of factoring a polynomial.
More informationFactorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
More informationArithmetic complexity in algebraic extensions
Arithmetic complexity in algebraic extensions Pavel Hrubeš Amir Yehudayoff Abstract Given a polynomial f with coefficients from a field F, is it easier to compute f over an extension R of F than over F?
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 informationAlgebra 3: algorithms in algebra
Algebra 3: algorithms in algebra Hans Sterk 2003-2004 ii Contents 1 Polynomials, Gröbner bases and Buchberger s algorithm 1 1.1 Introduction............................ 1 1.2 Polynomial rings and systems
More informationCopy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.
Algebra 2 - Chapter Prerequisites Vocabulary Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any. P1 p. 1 1. counting(natural) numbers - {1,2,3,4,...}
More informationProbability Generating Functions
page 39 Chapter 3 Probability Generating Functions 3 Preamble: Generating Functions Generating functions are widely used in mathematics, and play an important role in probability theory Consider a sequence
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 informationCongruence properties of binary partition functions
Congruence properties of binary partition functions Katherine Anders, Melissa Dennison, Jennifer Weber Lansing and Bruce Reznick Abstract. Let A be a finite subset of N containing 0, and let f(n) denote
More informationJacobi s four squares identity Martin Klazar
Jacobi s four squares identity Martin Klazar (lecture on the 7-th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i
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 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 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 informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationMath 231b Lecture 35. G. Quick
Math 231b Lecture 35 G. Quick 35. Lecture 35: Sphere bundles and the Adams conjecture 35.1. Sphere bundles. Let X be a connected finite cell complex. We saw that the J-homomorphism could be defined by
More informationit is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
More informationSome strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative variables
Available online at www.tjnsa.com J. Nonlinear Sci. Appl. 6 (013), 74 85 Research Article Some strong sufficient conditions for cyclic homogeneous polynomial inequalities of degree four in nonnegative
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
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 informationFOUNDATIONS 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 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 informationSOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE
SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE CRISTINA FLAUT and DIANA SAVIN Communicated by the former editorial board In this paper, we study some properties of the matrix representations of the
More information2 Polynomials over a field
2 Polynomials over a field A polynomial over a field F is a sequence (a 0, a 1, a 2,, a n, ) where a i F i with a i = 0 from some point on a i is called the i th coefficient of f We define three special
More informationModélisation et résolutions numérique et symbolique
Modélisation et résolutions numérique et symbolique via les logiciels Maple et Matlab Jeremy Berthomieu Mohab Safey El Din Stef Graillat Mohab.Safey@lip6.fr Outline Previous course: partial review of what
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 information2.4 Real Zeros of Polynomial Functions
SECTION 2.4 Real Zeros of Polynomial Functions 197 What you ll learn about Long Division and the Division Algorithm Remainder and Factor Theorems Synthetic Division Rational Zeros Theorem Upper and Lower
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationZeros 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 informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
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 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 informationCore Maths C1. Revision Notes
Core Maths C Revision Notes November 0 Core Maths C Algebra... Indices... Rules of indices... Surds... 4 Simplifying surds... 4 Rationalising the denominator... 4 Quadratic functions... 4 Completing the
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 information8.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 informationarxiv:math/0202219v1 [math.co] 21 Feb 2002
RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France
More informationFACTORING SPARSE POLYNOMIALS
FACTORING SPARSE POLYNOMIALS Theorem 1 (Schinzel): Let r be a positive integer, and fix non-zero integers a 0,..., a r. Let F (x 1,..., x r ) = a r x r + + a 1 x 1 + a 0. Then there exist finite sets S
More informationComputational algebraic geometry
Computational algebraic geometry Learning coefficients via symbolic and numerical methods Anton Leykin Georgia Tech AIM, Palo Alto, December 2011 Let k be a field (R or C). Ideals varieties Ideal in R
More informationfg = f g. 3.1.1. Ideals. An ideal of R is a nonempty k-subspace I R closed under multiplication by elements of R:
30 3. RINGS, IDEALS, AND GRÖBNER BASES 3.1. Polynomial rings and ideals The main object of study in this section is a polynomial ring in a finite number of variables R = k[x 1,..., x n ], where k is an
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 informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
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 informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More information1.7. Partial Fractions. 1.7.1. Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).
.7. PRTIL FRCTIONS 3.7. Partial Fractions.7.. Rational Functions and Partial Fractions. rational function is a quotient of two polynomials: R(x) = P (x) Q(x). Here we discuss how to integrate rational
More informationminimal 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 informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More information(a) Write each of p and q as a polynomial in x with coefficients in Z[y, z]. deg(p) = 7 deg(q) = 9
Homework #01, due 1/20/10 = 9.1.2, 9.1.4, 9.1.6, 9.1.8, 9.2.3 Additional problems for study: 9.1.1, 9.1.3, 9.1.5, 9.1.13, 9.2.1, 9.2.2, 9.2.4, 9.2.5, 9.2.6, 9.3.2, 9.3.3 9.1.1 (This problem was not assigned
More informationMathematics (MAT) MAT 061 Basic Euclidean Geometry 3 Hours. MAT 051 Pre-Algebra 4 Hours
MAT 051 Pre-Algebra Mathematics (MAT) MAT 051 is designed as a review of the basic operations of arithmetic and an introduction to algebra. The student must earn a grade of C or in order to enroll in MAT
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 informationPOLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS
POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).
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 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 informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationCyclotomic 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 informationSome applications of LLL
Some applications of LLL a. Factorization of polynomials As the title Factoring polynomials with rational coefficients of the original paper in which the LLL algorithm was first published (Mathematische
More informationGalois 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 informationHomework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
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 informationChapter 20. Vector Spaces and Bases
Chapter 20. Vector Spaces and Bases In this course, we have proceeded step-by-step through low-dimensional Linear Algebra. We have looked at lines, planes, hyperplanes, and have seen that there is no limit
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
More informationZeros 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 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 informationComputing divisors and common multiples of quasi-linear ordinary differential equations
Computing divisors and common multiples of quasi-linear ordinary differential equations Dima Grigoriev CNRS, Mathématiques, Université de Lille Villeneuve d Ascq, 59655, France Dmitry.Grigoryev@math.univ-lille1.fr
More informationSouth Carolina College- and Career-Ready (SCCCR) Algebra 1
South Carolina College- and Career-Ready (SCCCR) Algebra 1 South Carolina College- and Career-Ready Mathematical Process Standards The South Carolina College- and Career-Ready (SCCCR) Mathematical Process
More informationG(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s).
Transfer Functions The transfer function of a linear system is the ratio of the Laplace Transform of the output to the Laplace Transform of the input, i.e., Y (s)/u(s). Denoting this ratio by G(s), i.e.,
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 informationNon-unique factorization of polynomials over residue class rings of the integers
Comm. Algebra 39(4) 2011, pp 1482 1490 Non-unique factorization of polynomials over residue class rings of the integers Christopher Frei and Sophie Frisch Abstract. We investigate non-unique factorization
More information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationClassification of Cartan matrices
Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms
More informationALGEBRA 2 CRA 2 REVIEW - Chapters 1-6 Answer Section
ALGEBRA 2 CRA 2 REVIEW - Chapters 1-6 Answer Section MULTIPLE CHOICE 1. ANS: C 2. ANS: A 3. ANS: A OBJ: 5-3.1 Using Vertex Form SHORT ANSWER 4. ANS: (x + 6)(x 2 6x + 36) OBJ: 6-4.2 Solving Equations by
More informationNOV - 30211/II. 1. Let f(z) = sin z, z C. Then f(z) : 3. Let the sequence {a n } be given. (A) is bounded in the complex plane
Mathematical Sciences Paper II Time Allowed : 75 Minutes] [Maximum Marks : 100 Note : This Paper contains Fifty (50) multiple choice questions. Each question carries Two () marks. Attempt All questions.
More information