An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
|
|
- Emil Ford
- 5 years ago
- Views:
Transcription
1 An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD Dong Lu Key Laboratory of Mathematics Mechanization Academy of Mathematics and Systems Science, CAS Joint work with Deepak Kapur, Michael Monagan, Yao Sun and Dingkang Wang July 16-19, 2018, The City University of New York, USA Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 1 / 28
2 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 2 / 28
3 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 3 / 28
4 The Problem Notations k is a field. e 1 := (1, 0) and e 2 := (0, 1). X = {x 1,..., x n } are variables. U = {u 1,..., u m } are parameters. k[u][x ] is the polynomial ring in X. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 4 / 28
5 The Problem Example 1 Let f 1, f 2 C[a][x, y], where { f 1 = ax 3 + (a 3 a + 1)x 2 y + (a 2 + 2)xy 2 + (3a 2 3)y 3, f 2 = ax 3 + (a + 1)x 2 y + 4xy 2 + 3y 3. The results are: when a = 0, gcd(f 1, f 2 ) = y(x + 3y); when a 2 2 = 0, gcd(f 1, f 2 ) = 2x 3 + (a + 2)x 2 y + 4axy 2 + 3ay 3 ; when a(a 2 2) 0, gcd(f 1, f 2 ) = ax 2 + xy + 3y 2. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 5 / 28
6 The Problem Problem: For any given parametric polynomials f 1, f 2,..., f s in k[u][x ], how to divide the parametric space and obtain the corresponding GCD on each branch quickly? Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 6 / 28
7 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 7 / 28
8 Previous Works Non-parametric polynomials case J. Moses and D.Y.Y. Yun: The EZ GCD algorithm. In Proceedings of ACM 73, ACM Press, New York, 1973, (Hensel lifting) R. Zippel: Probabilistic algorithms for sparse polynomials. In Proceedings of EUROSAM 79, Springer-Verlag, 1979, (sparse interpolation) P. Gianni and B. Trager: GCDs and factoring multivariate polynomials using Gröbner bases. In Proceedings of EUROCAL 85, Springer, Berlin, Heidelberg, 1985, (Gröbner basis) T. Sasaki and M. Suzuki: Three new algorithms for multivariate polynomial GCD. Journal of Symbolic Computation, 1992, (Gröbner basis) Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 8 / 28
9 Previous Works Parametric polynomials case S.A. Abramov and K.Y. Kvashenko: On the greatest common divisor of polynomials which depend on a parameter. In Proceedings of ISSAC 1993, (subresultant chain) A. Ayad: Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials. International Journal of Algebra, 2010, (Gaussian elimination) K. Nagasaka: Parametric greatest common divisors using comprehensive Gröbner systems. In Proceedings of ISSAC 2017, (extended the ideas of Gianni and Trager as well as Sasaki and Suzuki) Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 9 / 28
10 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 10 / 28
11 The New Algorithm Non-parametric polynomials case Definition 1 Let I k[x ] be an ideal and g k[x ] \ {0}. The set I : g = {f k[x ] : fg I } is called the quotient ideal (or colon ideal) of I divided by g. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 11 / 28
12 The New Algorithm Non-parametric polynomials case Definition 1 Let I k[x ] be an ideal and g k[x ] \ {0}. The set I : g = {f k[x ] : fg I } is called the quotient ideal (or colon ideal) of I divided by g. Example 2 In k[x, y, z], let I = xy and g = xz. Then I : g = {f : xzf xy } = {f : zf y } = y. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 11 / 28
13 The New Algorithm Lemma 1 Let f 1, f 2 k[x ] \ {0}, then f 1 : f 2 is a principal ideal. Suppose that f 1 : f 2 = f, then we have gcd(f 1, f 2 ) = f 1 f. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 12 / 28
14 The New Algorithm Lemma 1 Let f 1, f 2 k[x ] \ {0}, then f 1 : f 2 is a principal ideal. Suppose that f 1 : f 2 = f, then we have gcd(f 1, f 2 ) = f 1 f. Example 3 Let f 1 = xy and f 2 = xz. According to the Example 2, we have that xy : xz = y. Then gcd(f 1, f 2 ) = f 1 /f = x. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 12 / 28
15 The New Algorithm Problem: How to compute the generator of f 1 : f 2? Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 13 / 28
16 The New Algorithm Problem: How to compute the generator of f 1 : f 2? Original Method Lemma 2 Let f 1, f 2 k[x ] \ {0} and w be a new variable, then wf 1, (w 1)f 2 k[x ] = g for some g k[x ] \ {0}. Moreover, we have f 1 : f 2 = g f 2 and gcd(f 1, f 2 ) = f 1f 2 g. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 13 / 28
17 The New Algorithm New Method Lemma 3 Let f 1, f 2 k[x ] \ {0} and be a monomial order on k[x ] 2 with e 2 e 1. Suppose G is a minimal Gröbner basis of f 1 e 1, f 2 e 1 e 2. Then there is a unique f k[x ] \ {0} such that f e 2 G and f 1 : f 2 = f. Therefore, gcd(f 1, f 2 ) = f 1 f. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 14 / 28
18 The New Algorithm New Method Lemma 3 Let f 1, f 2 k[x ] \ {0} and be a monomial order on k[x ] 2 with e 2 e 1. Suppose G is a minimal Gröbner basis of f 1 e 1, f 2 e 1 e 2. Then there is a unique f k[x ] \ {0} such that f e 2 G and f 1 : f 2 = f. Therefore, gcd(f 1, f 2 ) = f 1 f. Example 4 Let f 1 = xy, f 2 = xz. Given the lexicographic order and extend it to k[x ] 2 in a position over term with e 2 e 1. A minimal Gröbner basis of xy e 1, xz e 1 e 2 is G = {y e 2, xy e 1, xz e 1 e 2 }. So, f = y and xy : xz = y. Moreover, gcd(xy, xz) = f 1 /f = x. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 14 / 28
19 The New Algorithm Parametric polynomials case Theorem 1 Let f 1, f 2 k[u][x ] and be a monomial order on k[x ] 2 with e 2 e 1. Suppose {(A i, G i )} l i=1 is a minimal comprehensive Gröbner system of f 1 e 1, f 2 e 1 e 2. For each branch (A i, G i ), let H i = {f f e 2 G i }. Then we have 1 If H i =, then f 1 = 0 and gcd(f 1, f 2 ) = f 2 on A i. 2 If H i, then H i = {f } and gcd(f 1, f 2 ) = f 1 f on A i. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 15 / 28
20 The New Algorithm Parametric GCD Algorithm Input: f 1, f 2 k[u][x ], a constructible set A k m, and two monomial orders X, U. Output: a comprehensive GCDs: {(A i, h i )} s i=1, where h i = gcd(f 1, f 2) under any specialization from A i and s i=1a i = A. Step 1: compute a minimal comprehensive Gröbner system {(A i, G i )} s i=1 for the module f 1 e 1, f 2 e 1 e 2 on A. Step 2: For every i, let H i = {h h e 2 G i }, then do Step 2.1: if H i is empty, then h i = f 2 on A i and turn to Step 2; otherwise, turn to Step 2.2. Step 2.2: h i = f 1/h on A i. Step 3: return {(A i, h i )} s i=1. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 16 / 28
21 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 17 / 28
22 A Simple Example Example 5 Let f 1, f 2, f 3 C[a, b][x, y, z] be as follows: f 1 = ax 2 + bxy + a 2 xz + abx + abyz + b 2 y, f 2 = ax 2 + bxy + (ab a)xz a 2 x + (b 2 b)yz aby, f 3 = ax 2 + bxy + a 2 xz + (a 2 ab)x + abyz + (ab b 2 )y, Using the new algorithm to compute the GCDs of f 1, f 2, f 3. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 18 / 28
23 A Simple Example Monomial order: X and U are all lexicographic orders with x > y > z and a > b, respectively. We extend X to k[x ] 2 in a position over term with e 2 X e 1. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 19 / 28
24 A Simple Example Monomial order: X and U are all lexicographic orders with x > y > z and a > b, respectively. We extend X to k[x ] 2 in a position over term with e 2 X e 1. Step 1: Compute a minimal comprehensive Gröbner system (CGS) G 0 of f 1 e 1, f 2 e 1 e 2, and get six branches {(A i, G i )} 6 i=1. The first branch of G 0 is (A 1, G 1 ), where A 1 = V( 0 ) \ V( a 3 a 2 b + a 2 ), G 1 = {f 1 e 1, (x + az + b) e 2, ((a 2 ab + a)xz+ (a 2 + ab)x + (ab b 2 + b)yz + (ab + b 2 )y) e 1 + e 2 }. Then, H 1 = {x + az + b (x + az + b) e 2 G 1 } and the GCD of f 1 and f 2 on A 1 is h 1 = f 1 /(x + az + b) = ax + by. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 19 / 28
25 A Simple Example Similarly, the GCDs of f 1 and f 2 on other five branches are: (A 2, h 2 ) = (V( a b + 1 ) \ V( 2b 2 3b + 1 ), (b 1)x + by), (A 3, h 3 ) = (V( a, b 1 ), y), (A 4, h 4 ) = (V( 2a + 1, 2b 1 ) \ V( b 1 ), 1 2 x xy xz 1 4 x 1 4 yz y), (A 5, h 5 ) = (V( a, b ), 0), (A 6, h 6 ) = (V( a ) \ V( ab 3 ab 2 b 4 + 2b 3 b 2 ), by). Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 20 / 28
26 A Simple Example Step 2: For A 1, compute the GCD of h 1 and f 3. A minimal CGS G 1 of h 1 e 1, f 3 e 1 e 2 on A 1 has one branch: (A 1, G 11 ) = (V( 0 ) \ V( a 3 a 2 b + a 2 ), {e 2, h 1 e 1 }). Then H 11 = {1} and the GCD of h 1 and f 3 on A 1 is h 11 = h 1 /1 = ax + by. So, the GCD of f 1, f 2, f 3 on A 1 is gcd(f 1, f 2, f 3 ) = ax + by. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 21 / 28
27 A Simple Example Similarly, we can compute the GCD of h i and f 3 on A i, where i = 2,..., 6. Then the parametric GCDs of {f 1, f 2, f 3 } are (V( 0 ) \ V( a 3 a 2 b + a 2 ), ax + by), (V( a b + 1 ) \ V( 2b 2 3b + 1 ), (b 1)x + by), (V( a, b 1 ), y), (V( 2a + 1, 2b 1 ) \ V( b 1 ), x + y), (V( a, b ), 0), (V( a ) \ V( ab 3 ab 2 b 4 + 2b 3 b 2 ), by). Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 22 / 28
28 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 23 / 28
29 Implementation The new algorithm and two algorithms proposed by Nagasaka have been implemented in the Singular. More comparative examples can be generated by the codes at: The experimental data was obtained on a Core i GHz with 4GB Memory running Windows 7. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 24 / 28
30 Implementation Table: Timings(sec.) Ex. New NGT NSS > 1h > 1h > 1h > 1h > 1h > 1h > 1h > 1h NGT: K. Nagasaka, P. Gianni and B. Trager. NSS: K. Nagasaka, T. Sasaki and M. Suzuki. K. Nagasaka: Parametric greatest common divisors using comprehensive Gröbner systems, in Proceedings of ISSAC 2017, July 25-28, Kaiserslautern Germany. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 25 / 28
31 Outline 1 The Problem 2 Previous Works 3 The New Algorithm 4 A Simple Example 5 Implementation 6 Conclusions Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 26 / 28
32 Conclusions 1 We compute the GCDs of parametric polynomials by using quotient ideal and comprehensive Gröbner system of a module. 2 Our method does not need to compute the primitive part of parametric polynomials with respect to main variable. 3 Without any knowledge of f 1 or f 2 being zero or not on different branch, the GCDs of f 1 and f 2 can be obtained from the minimal comprehensive Gröbner system of f 1 e 1, f 2 e 1 e 2. 4 When we compute the GCDs of more than two parametric polynomials, the results can be obtained iteratively. Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 27 / 28
33 Thanks for your attention! Dong Lu (KLMM, AMSS, CAS) Algorithm for Computing Parametric GCD July 16-19, CUNY, New York 28 / 28
Parametric euclidean algorithm
Theoretical Mathematics & Applications, vol.3, no.3, 2013, 13-21 ISSN: 1792-9687 (print), 1792-9709 (online) Scienpress Ltd, 2013 Parametric euclidean algorithm Ali Ayad 1, Ali Fares 2 and Youssef Ayyad
More informationTowards High Performance Multivariate Factorization. Michael Monagan. This is joint work with Baris Tuncer.
Towards High Performance Multivariate Factorization Michael Monagan Center for Experimental and Constructive Mathematics Simon Fraser University British Columbia This is joint work with Baris Tuncer. The
More informationTowards High Performance Multivariate Factorization. Michael Monagan. This is joint work with Baris Tuncer.
Towards High Performance Multivariate Factorization Michael Monagan Center for Experimental and Constructive Mathematics Simon Fraser University British Columbia This is joint work with Baris Tuncer. To
More informationComputation of the Minimal Associated Primes
Computation of the Minimal Associated Primes Santiago Laplagne Departamento de Matemática, Universidad de Buenos Aires Buenos Aires, Argentina slaplagn@dm.uba.ar Abstract. We propose a new algorithm for
More informationSparse Polynomial Multiplication and Division in Maple 14
Sparse Polynomial Multiplication and Division in Maple 4 Michael Monagan and Roman Pearce Department of Mathematics, Simon Fraser University Burnaby B.C. V5A S6, Canada October 5, 9 Abstract We report
More informationPolynomial multiplication and division using heap.
Polynomial multiplication and division using heap. Michael Monagan and Roman Pearce Department of Mathematics, Simon Fraser University. Abstract We report on new code for sparse multivariate polynomial
More informationThe F 4 Algorithm. Dylan Peifer. 9 May Cornell University
The F 4 Algorithm Dylan Peifer Cornell University 9 May 2017 Gröbner Bases History Gröbner bases were introduced in 1965 in the PhD thesis of Bruno Buchberger under Wolfgang Gröbner. Buchberger s algorithm
More informationM3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS
M3P23, M4P23, M5P23: COMPUTATIONAL ALGEBRA & GEOMETRY REVISION SOLUTIONS (1) (a) Fix a monomial order. A finite subset G = {g 1,..., g m } of an ideal I k[x 1,..., x n ] is called a Gröbner basis if (LT(g
More informationPrimary Decomposition
Primary Decomposition p. Primary Decomposition Gerhard Pfister pfister@mathematik.uni-kl.de Departement of Mathematics University of Kaiserslautern Primary Decomposition p. Primary Decomposition:References
More informationComputer Algebra: General Principles
Computer Algebra: General Principles For article on related subject see SYMBOL MANIPULATION. Computer algebra is a branch of scientific computation. There are several characteristic features that distinguish
More informationExtremal Behaviour in Sectional Matrices
Extremal Behaviour in Sectional Matrices Elisa Palezzato 1 joint work with Anna Maria Bigatti 1 and Michele Torielli 2 1 University of Genova, Italy 2 Hokkaido University, Japan arxiv:1702.03292 Ph.D.
More informationOn Factorization of Multivariate Polynomials over Algebraic Number and Function Fields
On Factorization of Multivariate Polynomials over Algebraic Number and Function Fields ABSTRACT Seyed Mohammad Mahdi Javadi School of Computing Science Simon Fraser University Burnaby, B.C. Canada. sjavadi@cecm.sfu.ca.
More informationComputing with polynomials: Hensel constructions
Course Polynomials: Their Power and How to Use Them, JASS 07 Computing with polynomials: Hensel constructions Lukas Bulwahn March 28, 2007 Abstract To solve GCD calculations and factorization of polynomials
More informationUnit 3 Factors & Products
1 Unit 3 Factors & Products General Outcome: Develop algebraic reasoning and number sense. Specific Outcomes: 3.1 Demonstrate an understanding of factors of whole number by determining the: o prime factors
More informationPOLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada
THE TEACHING OF MATHEMATICS 2013, Vol. XVI, 1, pp. 22 28 POLYNOMIAL DIVISION AND GRÖBNER BASES Samira Zeada Abstract. Division in the ring of multivariate polynomials is usually not a part of the standard
More informationBlack Box Linear Algebra
Black Box Linear Algebra An Introduction to Wiedemann s Approach William J. Turner Department of Mathematics & Computer Science Wabash College Symbolic Computation Sometimes called Computer Algebra Symbols
More informationChange of Ordering for Regular Chains in Positive Dimension
Change of Ordering for Regular Chains in Positive Dimension X. Dahan, X. Jin, M. Moreno Maza, É. Schost University of Western Ontario, London, Ontario, Canada. École polytechnique, 91128 Palaiseau, France.
More informationLecture 4 February 5
Math 239: Discrete Mathematics for the Life Sciences Spring 2008 Lecture 4 February 5 Lecturer: Lior Pachter Scribe/ Editor: Michaeel Kazi/ Cynthia Vinzant 4.1 Introduction to Gröbner Bases In this lecture
More informationSymbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) RISC Research Institute for Symbolic Computation
Symbolic-Algebraic Methods for Linear Partial Differential Operators (LPDOs) Franz Winkler joint with Ekaterina Shemyakova RISC Research Institute for Symbolic Computation Johannes Kepler Universität.
More informationAlgorithms for the Non-monic Case of the Sparse Modular GCD Algorithm
Algorithms for the Non-monic Case of the Sparse Modular GCD Algorithm Jennifer de Kleine Department of Mathematics Simon Fraser University Burnaby, B.C. Canada. dekleine@cecm.sfu.ca. Michael Monagan Department
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationGroebner Bases and Applications
Groebner Bases and Applications Robert Hines December 16, 2014 1 Groebner Bases In this section we define Groebner Bases and discuss some of their basic properties, following the exposition in chapter
More informationPART II: Research Proposal Algorithms for the Simplification of Algebraic Formulae
Form 101 Part II 6 Monagan, 195283 PART II: Research Proposal Algorithms for the Simplification of Algebraic Formulae 1 Research Area Computer algebra (CA) or symbolic computation, as my field is known
More informationWORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE
WORKING WITH MULTIVARIATE POLYNOMIALS IN MAPLE JEFFREY B. FARR AND ROMAN PEARCE Abstract. We comment on the implementation of various algorithms in multivariate polynomial theory. Specifically, we describe
More informationSolving Approximate GCD of Multivariate Polynomials By Maple/Matlab/C Combination
Solving Approximate GCD of Multivariate Polynomials By Maple/Matlab/C Combination Kai Li Lihong Zhi Matu-Tarow Noda Department of Computer Science Ehime University, Japan {likai,lzhi,noda}@hpc.cs.ehime-u.ac.jp
More informationPolynomials. In many problems, it is useful to write polynomials as products. For example, when solving equations: Example:
Polynomials Monomials: 10, 5x, 3x 2, x 3, 4x 2 y 6, or 5xyz 2. A monomial is a product of quantities some of which are unknown. Polynomials: 10 + 5x 3x 2 + x 3, or 4x 2 y 6 + 5xyz 2. A polynomial is a
More informationCurrent Advances. Open Source Gröbner Basis Algorithms
Current Advances in Open Source Gröbner Basis Algorithms My name is Christian Eder I am from the University of Kaiserslautern 3 years ago Christian Eder, Jean-Charles Faugère A survey on signature-based
More informationLecture 15: Algebraic Geometry II
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 009 Today... Ideals in k[x] Properties of Gröbner bases Buchberger s algorithm Elimination theory The Weak Nullstellensatz 0/1-Integer
More informationNever leave a NEGATIVE EXPONENT or a ZERO EXPONENT in an answer in simplest form!!!!!
1 ICM Unit 0 Algebra Rules Lesson 1 Rules of Exponents RULE EXAMPLE EXPLANANTION a m a n = a m+n A) x x 6 = B) x 4 y 8 x 3 yz = When multiplying with like bases, keep the base and add the exponents. a
More informationModular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals. Masayuki Noro. Toru Aoyama
Modular Algorithms for Computing Minimal Associated Primes and Radicals of Polynomial Ideals Toru Aoyama Kobe University Department of Mathematics Graduate school of Science Rikkyo University Department
More informationSHUHONG GAO, DAQING WAN AND MINGSHENG WANG
PRIMARY DECOMPOSITION OF ZERO-DIMENSIONAL IDEALS OVER FINITE FIELDS SHUHONG GAO, DAQING WAN AND MINGSHENG WANG Abstract. A new algorithm is presented for computing primary decomposition of zero-dimensional
More informationChapter 4. Greatest common divisors of polynomials. 4.1 Polynomial remainder sequences
Chapter 4 Greatest common divisors of polynomials 4.1 Polynomial remainder sequences If K is a field, then K[x] is a Euclidean domain, so gcd(f, g) for f, g K[x] can be computed by the Euclidean algorithm.
More informationarxiv: v1 [math.ac] 14 Sep 2016
NEW STRATEGIES FOR STANDARD BASES OVER Z arxiv:1609.04257v1 [math.ac] 14 Sep 2016 CHRISTIAN EDER, GERHARD PFISTER, AND ADRIAN POPESCU Abstract. Experiences with the implementation of strong Gröbner bases
More informationAn Algorithm for Approximate Factorization of Bivariate Polynomials 1)
MM Research Preprints, 402 408 MMRC, AMSS, Academia Sinica No. 22, December 2003 An Algorithm for Approximate Factorization of Bivariate Polynomials 1) Zhengfeng Yang and Lihong Zhi 2) Abstract. In this
More informationThe Calculation of Radical Ideals in Positive Characteristic
J. Symbolic Computation (2002) 34, 229 238 doi:10.1006/jsco.2002.0560 Available online at http://www.idealibrary.com on The Calculation of Radical Ideals in Positive Characteristic GREGOR KEMPER IWR, Universität
More informationDaniel Lazard and Polynomial Systems A Personal View
Daniel Lazard and Polynomial Systems A Personal View James H. Davenport Department of Computer Science University of Bath Bath BA2 7AY England J.H.Davenport@bath.ac.uk December 1, 2004 1 Introduction This
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationFast Polynomial Reduction. Nikolay Vassiliev Steklov Inst. оf Math. St.Petersburg
Fast Polynomial Reduction Nikolay Vassiliev Steklov Inst. оf Math. St.Petersburg CADE2009, Papmlona, 2009 30 October Outline of the talk Gröbner bases and normal forms in commutative and differential algebra
More informationGröbner Bases. eliminating the leading term Buchberger s criterion and algorithm. construct wavelet filters
Gröbner Bases 1 S-polynomials eliminating the leading term Buchberger s criterion and algorithm 2 Wavelet Design construct wavelet filters 3 Proof of the Buchberger Criterion two lemmas proof of the Buchberger
More informationAlgebraic Factorization and GCD Computation
Chapter 1 Algebraic Factorization and GCD Computation Lihong Zhi This chapter describes several algorithms for factorization and GCD computation of polynomials over algebraic extension fields. These algorithms
More information8. Prime Factorization and Primary Decompositions
70 Andreas Gathmann 8. Prime Factorization and Primary Decompositions 13 When it comes to actual computations, Euclidean domains (or more generally principal ideal domains) are probably the nicest rings
More informationWhen does T equal sat(t)?
When does T equal sat(t)? Wei Pan joint work with François Lemaire, Marc Moreno Maza and Yuzhen Xie MOCAA M 3 workshop UWO May 7, 2008 1 Introduction Given a regular chain T, the saturated ideal sat(t)
More informationAn Algorithm For Splitting Polynomial Systems Based On F4
An Algorithm For Splitting Polynomial Systems Based On F4 ABSTRACT Michael Monagan mmonagan@cecm.sfu.ca Simon Fraser University Burnaby, BC, Canada We present algorithms for splitting polynomial systems
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationPOLYNOMIALS. x + 1 x x 4 + x 3. x x 3 x 2. x x 2 + x. x + 1 x 1
POLYNOMIALS A polynomial in x is an expression of the form p(x) = a 0 + a 1 x + a x +. + a n x n Where a 0, a 1, a. a n are real numbers and n is a non-negative integer and a n 0. A polynomial having only
More informationOn the minimal free resolution of a monomial ideal.
On the minimal free resolution of a monomial ideal. Caitlin M c Auley August 2012 Abstract Given a monomial ideal I in the polynomial ring S = k[x 1,..., x n ] over a field k, we construct a minimal free
More informationProblem Set 1 Solutions
Math 918 The Power of Monomial Ideals Problem Set 1 Solutions Due: Tuesday, February 16 (1) Let S = k[x 1,..., x n ] where k is a field. Fix a monomial order > σ on Z n 0. (a) Show that multideg(fg) =
More information1 Lecture # 1: Gröbner bases.
Gröbner Bases: a Tutorial Mike Stillman These notes are based on lectures given in Berkeley at M.S.R.I. in August 1998. They are meant to be an elementary introduction to the very useful notion of a Gröbner
More informationOn the BMS Algorithm
On the BMS Algorithm Shojiro Sakata The University of Electro-Communications Department of Information and Communication Engineering Chofu-shi, Tokyo 182-8585, JAPAN Abstract I will present a sketch of
More informationFast algorithms for factoring polynomials A selection. Erich Kaltofen North Carolina State University google->kaltofen google->han lu
Fast algorithms for factoring polynomials A selection Erich Kaltofen North Carolina State University google->kaltofen google->han lu Overview of my work 1 Theorem. Factorization in K[x] is undecidable
More informationNew Directions in Multivariate Public Key Cryptography
New Directions in Shuhong Gao Joint with Ray Heindl Clemson University The 4th International Workshop on Finite Fields and Applications Beijing University, May 28-30, 2010. 1 Public Key Cryptography in
More informationHilbert Polynomials. dimension and counting monomials. a Gröbner basis for I reduces to in > (I)
Hilbert Polynomials 1 Monomial Ideals dimension and counting monomials 2 The Dimension of a Variety a Gröbner basis for I reduces to in > (I) 3 The Complexity of Gröbner Bases a bound on the degrees of
More informationLocal properties of plane algebraic curves
Chapter 7 Local properties of plane algebraic curves Throughout this chapter let K be an algebraically closed field of characteristic zero, and as usual let A (K) be embedded into P (K) by identifying
More informationSOLVING VIA MODULAR METHODS
SOLVING VIA MODULAR METHODS DEEBA AFZAL, FAIRA KANWAL, GERHARD PFISTER, AND STEFAN STEIDEL Abstract. In this article we present a parallel modular algorithm to compute all solutions with multiplicities
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 27 January. Gröbner bases
Gröbner bases In this lecture we introduce Buchberger s algorithm to compute a Gröbner basis for an ideal, following [2]. We sketch an application in filter design. Showing the termination of Buchberger
More informationComputing the Bernstein-Sato polynomial
Computing the Bernstein-Sato polynomial Daniel Andres Kaiserslautern 14.10.2009 Daniel Andres (RWTH Aachen) Computing the Bernstein-Sato polynomial Kaiserslautern 2009 1 / 21 Overview 1 Introduction 2
More informationA gentle introduction to Elimination Theory. March METU. Zafeirakis Zafeirakopoulos
A gentle introduction to Elimination Theory March 2018 @ METU Zafeirakis Zafeirakopoulos Disclaimer Elimination theory is a very wide area of research. Z.Zafeirakopoulos 2 Disclaimer Elimination theory
More informationChapter 8. Exploring Polynomial Functions. Jennifer Huss
Chapter 8 Exploring Polynomial Functions Jennifer Huss 8-1 Polynomial Functions The degree of a polynomial is determined by the greatest exponent when there is only one variable (x) in the polynomial Polynomial
More informationModern Computer Algebra
Modern Computer Algebra JOACHIM VON ZUR GATHEN and JURGEN GERHARD Universitat Paderborn CAMBRIDGE UNIVERSITY PRESS Contents Introduction 1 1 Cyclohexane, cryptography, codes, and computer algebra 9 1.1
More informationGroebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics
Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics Tan Tran Junior Major-Economics& Mathematics History Groebner bases were developed by Buchberger in 1965, who later named
More informationreview To find the coefficient of all the terms in 15ab + 60bc 17ca: Coefficient of ab = 15 Coefficient of bc = 60 Coefficient of ca = -17
1. Revision Recall basic terms of algebraic expressions like Variable, Constant, Term, Coefficient, Polynomial etc. The coefficients of the terms in 4x 2 5xy + 6y 2 are Coefficient of 4x 2 is 4 Coefficient
More informationDeterminant Formulas for Inhomogeneous Linear Differential, Difference and q-difference Equations
MM Research Preprints, 112 119 No. 19, Dec. 2000. Beijing Determinant Formulas for Inhomogeneous Linear Differential, Difference and q-difference Equations Ziming Li MMRC, Academy of Mathematics and Systems
More informationALGORITHMS FOR ALGEBRAIC CURVES
ALGORITHMS FOR ALGEBRAIC CURVES SUMMARY OF LECTURE 7 I consider the problem of computing in Pic 0 (X) where X is a curve (absolutely integral, projective, smooth) over a field K. Typically K is a finite
More informationComputer Algebra and Formal Proof
James 1 University of Bath J.H.@bath.ac.uk 21 July 2017 1 Thanks to EU H2020-FETOPEN-2016-2017-CSA project SC 2 (712689) and the Isaac Newton Institute through EPSRC K/032208/1 Computer Algebra Systems
More informationAlgorithms for Algebraic Geometry
Chapter 2 Algorithms for Algebraic Geometry Outline: 1. Gröbner basics. 39 47 9 2. Algorithmic applications of Gröbner bases. 48 56 9 3. Resultants and Bézout s Theorem. 57 69 13 4. Solving equations with
More informationComputing Minimal Polynomial of Matrices over Algebraic Extension Fields
Bull. Math. Soc. Sci. Math. Roumanie Tome 56(104) No. 2, 2013, 217 228 Computing Minimal Polynomial of Matrices over Algebraic Extension Fields by Amir Hashemi and Benyamin M.-Alizadeh Abstract In this
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 6. Unique Factorization Domains
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 6 Unique Factorization Domains 1. Let R be a UFD. Let that a, b R be coprime elements (that is, gcd(a, b) R ) and c R. Suppose that a c and b c.
More informationVarious algorithms for the computation of Bernstein-Sato polynomial
Various algorithms for the computation of Bernstein-Sato polynomial Applications of Computer Algebra (ACA) 2008 Notations and Definitions Motivation Two Approaches Let K be a field and let D = K x, = K
More informationProjective Varieties. Chapter Projective Space and Algebraic Sets
Chapter 1 Projective Varieties 1.1 Projective Space and Algebraic Sets 1.1.1 Definition. Consider A n+1 = A n+1 (k). The set of all lines in A n+1 passing through the origin 0 = (0,..., 0) is called the
More informationRuppert matrix as subresultant mapping
Ruppert matrix as subresultant mapping Kosaku Nagasaka Kobe University JAPAN This presentation is powered by Mathematica 6. 09 : 29 : 35 16 Ruppert matrix as subresultant mapping Prev Next 2 CASC2007slideshow.nb
More informationPolynomial expression
1 Polynomial expression Polynomial expression A expression S(x) in one variable x is an algebraic expression in x term as Where an,an-1,,a,a0 are constant and real numbers and an is not equal to zero Some
More informationGeneration of. Polynomial Equality Invariants. by Abstract Interpretation
Generation of Polynomial Equality Invariants by Abstract Interpretation Enric Rodríguez-Carbonell Universitat Politècnica de Catalunya (UPC) Barcelona Joint work with Deepak Kapur (UNM) 1 Introduction
More informationON POLYNOMIAL CURVES IN THE AFFINE PLANE
ON POLYNOMIAL CURVES IN THE AFFINE PLANE Mitsushi FUJIMOTO, Masakazu SUZUKI and Kazuhiro YOKOYAMA Abstract A curve that can be parametrized by polynomials is called a polynomial curve. It is well-known
More informationThe Seven Dwarfs of Symbolic Computation and the Discovery of Reduced Symbolic Models. Erich Kaltofen North Carolina State University google->kaltofen
The Seven Dwarfs of Symbolic Computation and the Discovery of Reduced Symbolic Models Erich Kaltofen North Carolina State University google->kaltofen Outline 2 The 7 Dwarfs of Symbolic Computation Discovery
More informationSuperspecial curves of genus 4 in small charactersitic 8/5/2016 1
Superspecial curves of genus 4 in small charactersitic Mom onar i Kudo Graduate S chool of Mathemati c s, Ky ushu University, JAPAN 5 th August, @The University of Kaiserslautern, GERMANY This is a joint
More informationMutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis
MutantXL: Solving Multivariate Polynomial Equations for Cryptanalysis Johannes Buchmann 1, Jintai Ding 2, Mohamed Saied Emam Mohamed 1, and Wael Said Abd Elmageed Mohamed 1 1 TU Darmstadt, FB Informatik
More informationEfficient Multivariate Factorization Over Finite Fields
Efficient Multivariate Factorization Over Finite Fields Laurent Bernardin 1 and Michael B. Monagan 2 I Ifistitut ffir Wissenschaftliches Rechnen ETH Zfirich, Switzerland bernardin@inf, etl~. ch 2 Center
More informationA brief introduction to computational algebraic geometry
A brief introduction to computational algebraic geometry Evan M. Bullock This is a collection of lecture notes and problem sets from MATH 499: VIGRE Computational Algebraic Geometry at Rice University
More informationPractice problems for first midterm, Spring 98
Practice problems for first midterm, Spring 98 midterm to be held Wednesday, February 25, 1998, in class Dave Bayer, Modern Algebra All rings are assumed to be commutative with identity, as in our text.
More informationAn Abstract Interpretation Approach. for Automatic Generation of. Polynomial Invariants
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants Enric Rodríguez-Carbonell Universitat Politècnica de Catalunya Barcelona Deepak Kapur University of New Mexico Albuquerque
More informationProjection of Varieties and Elimination Ideals
Projection of Varieties and Elimination Ideals Applications: Word-Level Abstraction from Bit-Level Circuits, Combinational Verification, Reverse Engineering Functions from Circuits Priyank Kalla Associate
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationAlgebra Review. Terrametra Resources. Lynn Patten
Terrametra Resources Lynn Patten ALGEBRAIC EXPRESSION A combination of ordinary numbers, letter symbols, variables, grouping symbols and operation symbols. Numbers remain fixed in value and are referred
More informationAbstract Algebra for Polynomial Operations. Maya Mohsin Ahmed
Abstract Algebra for Polynomial Operations Maya Mohsin Ahmed c Maya Mohsin Ahmed 2009 ALL RIGHTS RESERVED To my students As we express our gratitude, we must never forget that the highest appreciation
More informationApplicability and Robustness of Monte Carlo Algorithms for Very Large Linear Algebra Problems. Ivan Dimov
Applicability and Robustness of Monte Carlo Algorithms for Very Large Linear Algebra Problems Ivan Dimov ACET, The University of Reading and IPP - BAS, Sofia Outline Motivation Markov Chain Monte Carlo
More informationMath 4370 Exam 1. Handed out March 9th 2010 Due March 18th 2010
Math 4370 Exam 1 Handed out March 9th 2010 Due March 18th 2010 Problem 1. Recall from problem 1.4.6.e in the book, that a generating set {f 1,..., f s } of I is minimal if I is not the ideal generated
More informationSYMMETRIC POLYNOMIALS
SYMMETRIC POLYNOMIALS KEITH CONRAD Let F be a field. A polynomial f(x 1,..., X n ) F [X 1,..., X n ] is called symmetric if it is unchanged by any permutation of its variables: for every permutation σ
More informationAlgebraic Cryptanalysis of MQQ Public Key Cryptosystem by MutantXL
Algebraic Cryptanalysis of MQQ Public Key Cryptosystem by MutantXL Mohamed Saied Emam Mohamed 1, Jintai Ding 2, and Johannes Buchmann 1 1 TU Darmstadt, FB Informatik Hochschulstrasse 10, 64289 Darmstadt,
More informationImplicitization of Rational Parametric Surfaces
J. Symbolic Computation (1996) 21, 329 336 Implicitization of Rational Parametric Surfaces GEORGE FIX, CHIH-PING HSU AND TIE LUO Box 19408, Mathematics Department The University of Texas at Arlington Arlington,
More informationSummer Project. August 10, 2001
Summer Project Bhavana Nancherla David Drescher August 10, 2001 Over the summer we embarked on a brief introduction to various concepts in algebraic geometry. We used the text Ideals, Varieties, and Algorithms,
More informationUnderstanding Branch Cuts of Expressions
The University of Bath Joint work with: Russell Bradford, James Davenport & David Wilson (Bath) and Edgardo Cheb-Terrab (Maplesoft) University of Waterloo 21st June 2013 Supported by the Engineering and
More information2.4. Solving ideal problems by Gröbner bases
Computer Algebra, F.Winkler, WS 2010/11 2.4. Solving ideal problems by Gröbner bases Computation in the vector space of polynomials modulo an ideal The ring K[X] /I of polynomials modulo the ideal I is
More informationGet Ready. 6. Expand using the distributive property. a) 6m(2m 4) b) 8xy(2x y) c) 6a 2 ( 3a + 4ab) d) 2a(b 2 6ab + 7)
Get Ready BLM 5 1... Classify Polynomials 1. Classify each polynomial by the number of terms. 2y x 2 + 3x + 2 c) 6x 2 y + 2xy + 4 d) x 2 + y 2 e) 3x 2 + 2x + y 4 6. Expand using the distributive property.
More informationAssigned homework problems S. L. Kleiman, fall 2008
18.705 Assigned homework problems S. L. Kleiman, fall 2008 Problem Set 1. Due 9/11 Problem R 1.5 Let ϕ: A B be a ring homomorphism. Prove that ϕ 1 takes prime ideals P of B to prime ideals of A. Prove
More informationComputing syzygies with Gröbner bases
Computing syzygies with Gröbner bases Steven V Sam July 2, 2008 1 Motivation. The aim of this article is to motivate the inclusion of Gröbner bases in algebraic geometry via the computation of syzygies.
More informationGröbner Bases. Applications in Cryptology
Gröbner Bases. Applications in Cryptology Jean-Charles Faugère INRIA, Université Paris 6, CNRS with partial support of Celar/DGA FSE 20007 - Luxembourg E cient Goal: how Gröbner bases can be used to break
More informationRational Univariate Reduction via Toric Resultants
Rational Univariate Reduction via Toric Resultants Koji Ouchi 1,2 John Keyser 1 Department of Computer Science, 3112 Texas A&M University, College Station, TX 77843-3112, USA Abstract We describe algorithms
More informationPREMUR Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications
PREMUR 2007 - Seminar Week 2 Discussions - Polynomial Division, Gröbner Bases, First Applications Day 1: Monomial Orders In class today, we introduced the definition of a monomial order in the polyomial
More informationGroebner bases under composition and multivariate matrix factorization
Groebner bases under composition and multivariate matrix factorization Mingsheng Wang Institute of Software, Chinese Academy of Sciences Contents of the talk In this talk, I will introduce some of my work
More information