Daniel Lazard and Polynomial Systems A Personal View
|
|
- Jeremy Patrick
- 6 years ago
- Views:
Transcription
1 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, Introduction This paper was given at the International Conference on Polynomial System Solving, held in Paris November 2004, in honour of the official retirement of Professor Daniel Lazard. The views expressed here are purely those of the author, and do not pretend to be complete. 1.1 EUROSAM 1979 Luminy (Springer LNCS 72) In this, the first computer algebra conference to be formally published 1, I wish to draw attention to two particular articles. 1. B. Buchberger A criterion for detecting unnecessary reductions in the construction of Groebner bases, pp D. Lazard Systems of algebraic equations, pp (see also [18]) It is interesting to observe that these appeared in very different sessions: the polynomial one and the linear algebra one. 1.2 The state of the art in 1979 It is difficult today to realise how different our understanding and research in polynomial systems was 25 years ago. The author is grateful to all those who have tried to explain the theories of polynomial systems to him, but above all, of course, to Daniel Lazard himself. 1 As opposed to special issues of the SIGSAM Bulletin, or institutional technical reports. 1
2 Buchberger s article only considered the ordering that today we would call total degree reverse lexicographic. In fact, the proofs are valid, with no changes, for any admissible ordering, but the concept did not exist then. Lazard s article required a total degree article, but a strict reading of the article (I am sure this was not intended) would allow orders incompatible with multiplication. In general, one can say that the today s usual formalisation (for example [4]) largely did not exist, and certainly was not structured, 25 years ago. 2 The meeting of concepts In reality, we should not speak of a single meeting, because these meetings have been the work of many people over the years, and one could easily say that there is more to do in in this direction. As far as I am concerned, though, one of the turning points was the article Gröbner Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations, which Lazard published in 1983 [22]. 2.1 The FGLM algorithm This algorithm [13] converts a zero-dimensional (finite number of solutions) Gröbner base with respect to one ordering < (typically total degree reverse lexicographic ) to another < (often purely lexicographic, so that one can use the Gianni Kalkbrener theorem [14, 15] to read off the solutions). It is certainly unnecessary to explain this algorithm to such an audience! However, I would rather make two observations about it. The enormous practical importance of this algorithm; The fact that this algorithm can easily be considered as a hybrid between the polynomial approach and the linear algebra approach. In brief, one enumerates the monomials in increasing order with respect to <, reducing each (a polynomial calculation) by the input basis with respect to <, and look for linear relations between these reducta, which are being viewed as a matrix of coefficients with the columns labelled by the relevant monomials. Such a linear relation, translated back to the original monomials enumerated wth respect to <, gives an element of the Gröbner base with respect to <. 3 Do we really want a single Gröbner Base? There may be occasions on which our real goal, say finding the solutions of a set of polynomial equations F, can be met by other techniques than computing a full Gröbner base of the ideal generated by F. 2
3 3.1 Factored Gröbner bases In the 1980 s, many people [12, 11] had the following idea. Suppose we are computing a Gröbner base, and currently G = {g 1,..., g n } defines a variety V, and g 1 (say) = h 1 h 1. Then, instead of continuing to apply Buchberger s algorithm to G, we can continue Buchberger s algorithm on two forks: G 1 = {h 1, g 2,..., g n } defining V 1, and G 2 = {h 1, g 2,..., g n } defining V 2, where V = V 1 V 2. Of course, this process can be done recursively. pro h i, h i will have lower degree than g 1: indeed it is common for them to reduce many of the other g i. Therefore it is normal for the computing time for G 1 and G 2 to total far less than the computing time for G itself. con If this happens, then all the gains from Buchberger s third criterion [8] and its generalisation [2] are lost one is essentially starting afresh. pro The structure of V 1 V 2 may be much easier to understand, particularly if V is not equi-dimensional. con We do not actually have a Gröbner base for V. con It is very hard to track multiplicities, and to avoid duplication. con Empirically, factorisation is rare except in a purely lexicographic order, which FGLM means we rarely use Buchberger s algorithm for directly. pro It is possible to devise fast probabilistic tests for irreducibility [12]. 3.2 Triangular sets We wish to describe the affine variety V (F ) (i.e. the common zeros) of a finite set of polynomials F. We will do this via a family {T 1,..., T r } of sets of polynomials. Let T 1 be a Gröbner basis of F. Let T i be such that distinct polynomials in T i have distinct main variables: we say that T i is triangular [30, but he called them characteristic sets ]. Say that ζ V (T i ) is regular [33] if it does not cancel the leading coefficient 2 of any member of T i. Then V (F ) is the union of the regular zeros of the T i, denoted by W (T i ). Unfortunately, there are several definitions of triangular sets, classified by [25] and summarised in [1]. The main ones are: characteristic sets [30, 33, though the definitions are slightly different [1]]; 2 With respect to whatever variable is in fact the leading variable of this particular polynomial. 3
4 regular chains and their representations [16]; normalized triangular sets [24]; tower of simple extensions [24]; regular sets [29]. characteristic sets The algorithm of [31] produces from F a family T 1,..., T l of characteristic sets of prime ideals such that V (F ) = l i=1 W (T i). [1, Theorem 3.3] gives some elegant properties of characteristic sets of prime ideals. Given F, the algorithm of [33] computes a characteristic set T of a finite set of polynomials G such that F and G generate the same ideal 3. 4 Is Lazard purely a specialist in polynomial systems? Certainly not. One could easily cite the following. His research on the factorisation of polynomials [20, 19]. His research on the algorithmics of Z[i] [21]. His work on the radicals of differential ideals [5]. His work on quantifier elimination, where in particular he showed that the purely algorithmic methods known at the time would give results far larger and clumsier than was necessary [23]. This and similar observations led to the development of partial cylindrical algebraic decomposition [9]. Later on he also found a better algorithm for the projection stage in cylindrical algebraic decomposition [26], and further developments of this are found in the latest software [7]. His improvement (with Rioboo) of the integration of rational functions, which avoided spurious singularities in the logarithmic part of the integral [27]. His algorithm (with Valibouze) for the inverse of the primitive element algorithm [28]. We give some notes on the importance of some of these points. 4.1 Cylindrical Algebraic Decomposition Cylindrical algebraic decomposition is an algebraic tool. However, we [6, 3] have been able to use it to solve analytic simplication problems currently a major 3 Note, however, that this does not mean that T is necessarily a characteristic set of F [1]. 4
5 challenge for all computer algebra systems. Consider for example the following pseudo-equality 4 : a b? = ab. The validity of this depends on a and b. For example, for 1 z 1 + z? = 1 z 2 the answer is positive, but for the apparently similar z 1 z + 1? = z 2 1, the answer is false if z = 2, the left-hand side is negative, but the righthand side is positive. 4.2 Integration analytic and algebraic Everyone (at least mathematicians would like to think so) knows that the indefinite integral of a function is determined up to a constant. Analytically, c is a constant iff x, y c(x) = c(y). Therefore, when we calculate a definite integral via an indefinite one, the constants cancel. Algebraically 5, a constant c is such that c = 0, so for example the Heaviside function is an algebraic constant. Hence it is important to avoid spurious singularities in an indefinite integral calculated algebraically [32, for example], otherwise the constant might not be an analytic constant. References [1] Aubry, P., Lazard, D., and Moreno Maza, M. On the Theories of Triangular Sets. J. Symbolic Comp. 28 (1999), [2] Backelin, J., and Fröberg, R. How we proved that there are exactly 924 cyclic 7-roots. In Proceedings ISSAC 1991 (1991), S. Watt, Ed., pp [3] Beaumont, J., Bradford, R., Davenport, J., and Phisanbut, N. A Poly-Algorithmic Approach to Simplifying Elementary Functions. In Proceedings ISSAC 2004 (2004), pp [4] Becker, T., and Weispfeninng, V. w. H. K. Groebner Bases. A Computational Approach to Commutative Algebra. Springer Verlag (1993). [5] Boulier, F., Lazard, D., Ollivier, F., and Petitot, M. Representation for the radical of a finitely generated differential ideal. In Proceedings ISSAC 1995 (1995), A. Levelt, Ed. [6] Bradford, R., and Davenport, J. Towards Better Simplification of Elementary Functions. In Proceedings ISSAC 2002 (2002), T. Mora, Ed., pp Similar issues apply to logarithms, and indeed all inherently multivalued inverse functions [10]. Futhermore, they are not limited to cases that involve complex numbers: see [6] for a discussion of arctan x + arctan y =? arctan 1 xy over R R. 5 x+y In the sense of Differential Algebra [17]. 5
6 [7] Brown, C. Improved Projection for Cylindrical Algebraic Decomposition. J. Symbolic Comp. 32 (2001), [8] Buchberger, B. A Criterion for Detecting Unnecessary Reductions in the Construction of Groebner Bases. In Proceedings EUROSAM 79 (1979), pp [9] Collins, G., and Hong, H. Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. J. Symbolic Comp. 12 (1991), [10] Corless, R., Davenport, J., Jeffrey, D., and Watt, S. According to Abramowitz and Stegun. SIGSAM Bulletin 2 34 (2000), [11] Czapor, S. Solving Algebraic Equations: Combining Buchberger s Algorithm with Multivariate Factorization. J. Symbolic Comp. 7 (1989), [12] Davenport, J. Looking at a set of equations. Tech. Rep , [13] Faugère, J., Gianni, P., Lazard, D., and Mora, T. Efficient Computation of Zero-Dimensional Gröbner Bases by Change of Ordering. J. Symbolic Comp. 16 (1993), [14] Gianni, P. Properties of Gröbner bases under specializations. In Proceedings EUROCAL 87 (1989), pp [15] Kalkbrener, M. Solving systems of algebraic equations by using Gröbner bases. In Proceedings EUROCAL 87 (1989), pp [16] Kalkbrener, M. Three contributions to elimination theory. PhD thesis, Johannes Kepler University, [17] Kolchin, E. Differential Algebra and Algebraic Groups. Academic Press (1973). [18] Lazard, D. Résolution des Systèmes Comp. Sci. 15 (1981), d Équations Algébriques. Theor. [19] Lazard, D. Factorisation des Polynômes. Les Mathématiques de l Informatique (1982), [20] Lazard, D. On Polynomial Factorization. In Proceedings EUROCAM 82 [Springer Lecture Notes in Computer Science 144 (1982), pp [21] Lazard, D. On the Minimal Algorithm in Rings of Imaginary Quadratic Integers. J. Number Theory 15 (1982), [22] Lazard, D. Gröbner Bases, Gaussian Elimination and Resolution of Systems of Algebraic Equations. In Proceedings EUROCAL 83 [Springer Lecture Notes in Computer Science 162 (1983), pp [23] Lazard, D. Quantifier Elimination: Optimal Solution for Two Classical Problems. J. Symbolic Comp. 5 (1988),
7 [24] Lazard, D. A New Method for Solving Algebraic Systems of Positive Dimension. Discr. Appl. Math. 33 (1991), [25] Lazard, D. Systems of algebraic equations (algorithms and complexity). Cortona Proceedings (1991). [26] Lazard, D. An Improved Projection Operator for Cylindrical Algebraic Decomposition. Algebraic Geometry and its Applications (1994). [27] Lazard, D., and Rioboo, R. Integration of Rational Functions - Rational Computation of the Logarithmic Part. J. Symbolic Comp. 9 (1990), [28] Lazard, D., and Valibouze, A. Computing Subfields: Reverse of the Primitive Element Problem. In Proceedings MEGA 92 (1993), F. Eysette and A. Galligo, Eds., pp [29] Moreno Maza, M. Calculs de Pgcd au-dessus des Tours d Extensions Simples et Résolution des Systèmes d Équations Algébriques. PhD thesis, Thesis, [30] Ritt, J. Differential Equations from an Algebraic Standpoint. Volume 14 (1932). [31] Ritt, J. Differential Algebra. American Mathematical Society Colloquium Proceedings vol. XXXIII (1950). [32] Trager, B. Algebraic Factoring and Rational Function Integration. In Proceedings SYMSAC 76 (1976), R. Jenks, Ed., pp [33] Wu, W.-T. A Zero Structure Theorem for Polynomial Equations Solving. MM Research Preprints 1 (1987),
Change 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 informationComputations with Differential Rational Parametric Equations 1)
MM Research Preprints,23 29 No. 18, Dec. 1999. Beijing 23 Computations with Differential Rational Parametric Equations 1) Xiao-Shan Gao Institute of Systems Science Academia Sinica, Beijing, 100080 Abstract.
More informationStandard bases in differential algebra
Standard bases in differential algebra E.V. Pankratiev and A.I. Zobnin April 7, 2006 1 Gröbner bases of polynomial ideals Let R = k[x 0,..., x m ] be the polynomial ring over a field k. By T = T (X) we
More informationJournal of Symbolic Computation. Thirty years of Polynomial System Solving, and now?
Journal of Symbolic Computation 44 (2009) 222 231 Contents lists available at ScienceDirect Journal of Symbolic Computation journal homepage: www.elsevier.com/locate/jsc Thirty years of Polynomial System
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 informationMöller s Algorithm. the algorithm developed in [14] was improved in [18] and applied in order to solve the FGLM-problem;
Möller s Algorithm Teo Mora (theomora@disi.unige.it) Duality was introduced in Commutative Algebra in 1982 by the seminal paper [14] but the relevance of this result became clear after the same duality
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 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 informationCounting and Gröbner Bases
J. Symbolic Computation (2001) 31, 307 313 doi:10.1006/jsco.2000.1575 Available online at http://www.idealibrary.com on Counting and Gröbner Bases K. KALORKOTI School of Computer Science, University of
More informationSolving Parametric Polynomial Systems by RealComprehensiveTriangularize
Solving Parametric Polynomial Systems by RealComprehensiveTriangularize Changbo Chen 1 and Marc Moreno Maza 2 1 Chongqing Key Laboratory of Automated Reasoning and Cognition, Chongqing Institute of Green
More informationFiniteness Issues on Differential Standard Bases
Finiteness Issues on Differential Standard Bases Alexey Zobnin Joint research with M.V. Kondratieva and D. Trushin Department of Mechanics and Mathematics Moscow State University e-mail: al zobnin@shade.msu.ru
More informationSMT Nonlinear Real Arithmetic and Computer Algebra: a Dialog
SMT Nonlinear Real Arithmetic and Computer Algebra: a Dialogue of the Deaf? James 1 University of Bath J.H.@bath.ac.uk 23 July 2017 1 Thanks to EU H2020-FETOPEN-2016-2017-CSA project SC 2 (712689) and
More informationAlgebraic Characterization of Minimum Weight Codewords of Cyclic Codes
Algebraic Characterization of Minimum Weight Codewords of Cyclic Codes Daniel Augot Abstract We consider primitive cyclic codes of length n over GF (q), where n = q m 1, and for any such code with defining
More informationGröbner Bases: A Short Introduction for Systems Theorists
Gröbner Bases: A Short Introduction for Systems Theorists Bruno Buchberger Research Institute for Symbolic Computation University of Linz, A4232 Schloss Hagenberg, Austria Buchberger@RISC.Uni Linz.ac.at
More informationWhat does without loss of generality mean (and how do we detect it)
What does without loss of generality mean (and how do we detect it) James Davenport Hebron & Medlock Professor of Information Technology 1 University of Bath (U.K.) 1 August 2016 1 Thanks to Matthew England
More informationFormulating Problems in Real Algebra/Geometry
Formulating Problems in Real Algebra/Geometry James Davenport Hebron & Medlock Professor of Information Technology 1 University of Bath (U.K.) 30 January 2014 1 Thanks to Russell Bradford, Matthew England,
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 informationAn Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
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,
More informationA HYPERGEOMETRIC INEQUALITY
A HYPERGEOMETRIC INEQUALITY ATUL DIXIT, VICTOR H. MOLL, AND VERONIKA PILLWEIN Abstract. A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal.
More informationComputing subfields : Reverse of the primitive element problem
Computing subfields : Reverse of the primitive element problem Daniel Lazard, Annick Valibouze To cite this version: Daniel Lazard, Annick Valibouze. Computing subfields : Reverse of the primitive element
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Friday 31 January. Quotient Rings
Quotient Rings In this note we consider again ideals, but here we do not start from polynomials, but from a finite set of points. The application in statistics and the pseudo code of the Buchberger-Möller
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 informationChoosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition Matthew England, Russell Bradford, James H. Davenport, and David Wilson
More information16.29 GUARDIAN: Guarded Expressions in Practice
564 CHAPTER 16 USER CONTRIBUTED PACKAGES 1629 GUARDIAN: Guarded Expressions in Practice Computer algebra systems typically drop some degenerate cases when evaluating expressions, eg, x/x becomes 1 dropping
More informationPolynomial System Example Bank Version 4.0-1/4/13
Polynomial System Example Bank Version 4.0-1/4/13 David John Wilson PhD Candidate, University of Bath Current draft: April 8, 2013 Contents 1 Introduction 2 2 Examples from CMXY09 3 3 Branch Cut Examples
More informationTeaching Commutative Algebra and Algebraic Geometry. Geometry using Computer Algebra Systems
Teaching Commutative Algebra and Algebraic Geometry using Computer Algebra Systems Department of Mathematics, Simon Fraser University British Columbia, CANADA Computer Algebra in Education ACA 2012, Sofia,
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 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 informationRational Numbers. a) 5 is a rational number TRUE FALSE. is a rational number TRUE FALSE
Fry Texas A&M University!! Math 150!! Chapter 1!! Fall 2014! 1 Chapter 1A - - Real Numbers Types of Real Numbers Name(s) for the set 1, 2,, 4, Natural Numbers Positive Integers Symbol(s) for the set, -,
More informationADVANCED TOPICS IN ALGEBRAIC GEOMETRY
ADVANCED TOPICS IN ALGEBRAIC GEOMETRY DAVID WHITE Outline of talk: My goal is to introduce a few more advanced topics in algebraic geometry but not to go into too much detail. This will be a survey of
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 informationChapter 1A -- Real Numbers. iff. Math Symbols: Sets of Numbers
Fry Texas A&M University! Fall 2016! Math 150 Notes! Section 1A! Page 1 Chapter 1A -- Real Numbers Math Symbols: iff or Example: Let A = {2, 4, 6, 8, 10, 12, 14, 16,...} and let B = {3, 6, 9, 12, 15, 18,
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 informationGeneral error locator polynomials for nth-root codes
General error locator polynomials for nth-root codes Marta Giorgetti 1 and Massimiliano Sala 2 1 Department of Mathematics, University of Milano, Italy 2 Boole Centre for Research in Informatics, UCC Cork,
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationNatural Numbers Positive Integers. Rational Numbers
Chapter A - - Real Numbers Types of Real Numbers, 2,, 4, Name(s) for the set Natural Numbers Positive Integers Symbol(s) for the set, -, - 2, - Negative integers 0,, 2,, 4, Non- negative integers, -, -
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 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 informationOn Approximate Linearized Triangular Decompositions
On Approximate Linearized Triangular Decompositions Marc Moreno Maza, Greg Reid, Robin Scott and Wenyuan Wu Abstract. In this series of papers On Approximate Triangular Decompositions, we describe progress
More informationSolving computational problems in real algebra/geometry
Annales Mathematicae et Informaticae 44 (2015) pp. 35 46 http://ami.ektf.hu Solving computational problems in real algebra/geometry James H. Davenport University of Bath (U.K.) J.H.Davenport@bath.ac.uk
More informationProgram Veri cation in the presence of complex numbers, functions with branch cuts etc.
2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Program Verication in the presence of complex numbers, functions with branch cuts etc. James H. Davenport,
More informationSOLVING ALGEBRAIC INEQUALITIES
SOLVING ALGEBRAIC INEQUALITIES ADAM STRZEBOŃSKI ABSTRACT. We study the problem of solving, possibly quantified, systems of real algebraic equations and inequalities. We propose a way of representing solution
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 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 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 informationAlgorithmic properties of polynomial rings
Algorithmic properties of polynomial rings MICHAEL KALKBRENER Department of Mathematics, Swiss Federal Institute of Technology, Zurich, Switzerland In this paper we investigate how algorithms for computing
More informationGroebner Bases in Boolean Rings. for Model Checking and. Applications in Bioinformatics
Groebner Bases in Boolean Rings for Model Checking and Applications in Bioinformatics Quoc-Nam Tran, Ph.D. Professor of Computer Science Lamar University Invited Talk at CMU on October 8, 2010 Outline
More informationUniversity of Bath. Publication date: Document Version Peer reviewed version. Link to publication
Citation for published version: Davenport, J 2012, 'Program Verification in the presence of complex numbers, functions with branch cuts etc' Paper presented at SYNASC 2012: 14th International Symposium
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 information4 Hilbert s Basis Theorem and Gröbner basis
4 Hilbert s Basis Theorem and Gröbner basis We define Gröbner bases of ideals in multivariate polynomial rings and see how they work in tandem with the division algorithm. We look again at the standard
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 informationCommutative Algebra and Algebraic Geometry
Commutative Algebra and Algebraic Geometry Lecture Notes Johannes Kepler Universität Linz Summer 2018 Prof. Franz Winkler c Copyright by F. Winkler Contents References 1. Introduction....................................................................1
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 informationStandard Bases for Linear Codes over Prime Fields
Standard Bases for Linear Codes over Prime Fields arxiv:1708.05490v1 cs.it] 18 Aug 2017 Jean Jacques Ferdinand RANDRIAMIARAMPANAHY 1 e-mail : randriamiferdinand@gmail.com Harinaivo ANDRIATAHINY 2 e-mail
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 informationI. Duality. Macaulay F. S., The Algebraic Theory of Modular Systems, Cambridge Univ. Press (1916);
I. Duality Macaulay F. S., On the Resolution of a given Modular System into Primary Systems including some Properties of Hilbert Numbers, Math. Ann. 74 (1913), 66 121; Macaulay F. S., The Algebraic Theory
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 informationGalois groups of polynomials and the construction of finite fields
Pure and Applied Mathematics Journal 01; 1(1) : 10-16 Published online December 0, 01 (http://wwwsciencepublishinggroupcom/j/pamj) doi: 1011648/jpamj0101011 Galois groups of polynomials and the construction
More informationA Zero Structure Theorem for Differential Parametric Systems
A Zero Structure Theorem for Differential Parametric Systems XIAO-SHAN GAO Institute of Systems Science, Academia Sinica, Beijing SHANG-CHING CHOU Department of Computer Science Wichita State University,Wichita
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
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 informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
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 informationConstruction of a Class of Algebraic-Geometric Codes via Gröbner Bases
MM Research Preprints, 42 48 No. 16, April 1998. Beijing Construction of a Class of Algebraic-Geometric Codes via Gröbner Bases Changyan Di, Zhuojun Liu Institute of Systems Science Academia Sinica, Beijing
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 informationGröbner Bases over a Dual Valuation Domain
International Journal of Algebra, Vol. 7, 2013, no. 11, 539-548 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.3550 Gröbner Bases over a Dual Valuation Domain André Saint Eudes Mialébama
More informationOn the Normal Parameterization of Curves and Surfaces
On the Normal Parameterization of Curves and Surfaces Xiao-Shan Gao Institute of Systems Science, Academia Sinica, Beijing Shang-Ching Chou The University of Texas at Austin, Austin, Texas 78712 USA International
More informationCAD: Algorithmic Real Algebraic Geometry
1 2 University of Bath z.p.tonks@bath.ac.uk 20 June 2018 1 Many thanks to my supervisor James Davenport, and colleagues Akshar Nair (Bath) & Matthew England (Coventry) 2 Also thanks to Maplesoft, and grants
More informationUnderstanding and Implementing F5
Understanding and Implementing F5 John Perry john.perry@usm.edu University of Southern Mississippi Understanding and Implementing F5 p.1 Overview Understanding F5 Description Criteria Proofs Implementing
More informationABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n
ABSTRACT Title of Thesis: GRÖBNER BASES WITH APPLICATIONS IN GRAPH THEORY Degree candidate: Angela M. Hennessy Degree and year: Master of Arts, 2006 Thesis directed by: Professor Lawrence C. Washington
More informationQuantifier Elimination
J.JSSAC (2003) Vol. 10, No. 1, pp. 3-12 Quantifier Elimination Quantifier Elimination ( ) IT 1 (quantifier elimination problem) (formal theory) ( ) (quantifier elimination :QE) (elementary theory of real
More informationThe generic Gröbner walk
The generic Gröbner walk K. Fukuda, A. N. Jensen, N. Lauritzen, R. Thomas arxiv:math/0501345v1 [math.ac] 21 Jan 2005 February 28, 2008 Abstract The Gröbner walk is an algorithm for conversion between Gröbner
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationAbstract We report on some experience with a new version of the well known Grobner algorithm with factorization and constraint inequalities, implement
On Factorized Grobner Bases Hans-Gert Grabe Institut fur Informatik Universitat Leipzig Augustusplatz 10-11 04109 Leipzig (Germany) graebe@informatik.uni-leipzig.de Report No. 6 October 1994 Abstract We
More informationTowards abstract and executable multivariate polynomials in Isabelle
Towards abstract and executable multivariate polynomials in Isabelle Florian Haftmann Andreas Lochbihler Wolfgang Schreiner Institute for Informatics Institute of Information Security RISC TU Munich ETH
More informationApproximate symmetry analysis
Approximate symmetry analysis Saturday June 7, 10:00 10:35 am Greg Reid 1 Ian Lisle and Tracy Huang 2 CMS Summer Meeting Session on Gröbner Bases and Computer Algebra Winnipeg 1 Ontario Research Centre
More informationTruth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains
Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains Russell Bradford 1, Changbo Chen 2, James H. Davenport 1, Matthew England 1, Marc Moreno Maza 3 and David Wilson 1 1 University
More informationOil Fields and Hilbert Schemes
Oil Fields and Hilbert Schemes Lorenzo Robbiano Università di Genova Dipartimento di Matematica Lorenzo Robbiano (Università di Genova) Oil Fields and Hilbert Schemes March, 2008 1 / 35 Facts In the realm
More informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
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 informationComplexity Analysis of the Bivariate Buchberger Algorithm in Theorema
Complexity Analysis of the Bivariate Buchberger Algorithm in Theorema Alexander Maletzky 1 and Bruno Buchberger 2 1 Doctoral College Computational Mathematics and RISC, Johannes Kepler University, Linz,
More informationA Piano Movers Problem Reformulated
James (Bath) Thanks to Russell Bradford, Matthew England and David Wilson (Bath) 28 September 2012 Background Thirty years ago [SS83b, and others] showed that many problems of robot motion planning can
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
More informationALGORITHM FAUGÈRE'S F 5
FAUGÈRE'S F 5 ALGORITHM JOHN PERRY Abstract. This report gives pseucode for an implementation the F 5 algorithm, noting errors found both in Faugère's seminal 2002 paper and Stegers' 2006 undergraduate
More informationNumerical Irreducible Decomposition
Numerical Irreducible Decomposition Jan Verschelde Department of Math, Stat & CS University of Illinois at Chicago Chicago, IL 60607-7045, USA e-mail: jan@math.uic.edu web: www.math.uic.edu/ jan CIMPA
More informationThe minimal components of the Mayr-Meyer ideals
The minimal components of the Mayr-Meyer ideals Irena Swanson 24 April 2003 Grete Hermann proved in [H] that for any ideal I in an n-dimensional polynomial ring over the field of rational numbers, if I
More informationIntroduction to Gröbner Bases for Geometric Modeling. Geometric & Solid Modeling 1989 Christoph M. Hoffmann
Introduction to Gröbner Bases for Geometric Modeling Geometric & Solid Modeling 1989 Christoph M. Hoffmann Algebraic Geometry Branch of mathematics. Express geometric facts in algebraic terms in order
More informationThe problem of integration in finite terms
The problem of integration in finite terms Symbolic Integration Lecture 14 1. The Freshman Calculus Problem 2. The Artificial Intelligence Problem 3. The Algebraic (Rational Function) Problem 4. The Decision
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 informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationAlternative to Ritt s Pseudodivision for finding the input-output equations in algebraic structural identifiability analysis
Abstract Alternative to Ritt s Pseudodivision for finding the input-output equations in algebraic structural identifiability analysis Nicolette Meshkat¹*, Chris Anderson², and Joseph J. DiStefano III³
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
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 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 informationMonomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra
Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra Susan M. Hermiller Department of Mathematics and Statistics University of Nebraska-Lincoln Lincoln, NE
More informationComputing with Constructible Sets in Maple
Computing with Constructible Sets in Maple Changbo Chen a François Lemaire b Marc Moreno Maza a Liyun Li a Wei Pan a Yuzhen Xie c a University of Western Ontario Department of Computer Science London,
More informationSome Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity
J. Symbolic Computation (1994 11, 1 7 Some Questions Concerning Computer-Generated Proofs of a Binomial Double-Sum Identity GEORGE E. ANDREWS AND PETER PAULE Department of Mathematics, Pennsylvania State
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 informationOpus: University of Bath Online Publication Store
Bradford, R., Davenport, J.H., England, M., McCallum, S. and Wilson, D. (2014) Truth table invariant cylindrical algebraic decomposition. Unpublished (Submitted). (Unpublished) Link to official URL (if
More information