Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Explicit factors of some iterated resultants and discriminants
HTML articles powered by AMS MathViewer

by Laurent Busé and Bernard Mourrain PDF
Math. Comp. 78 (2009), 345-386 Request permission

Abstract:

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into irreducible factors of several constructions involving two times iterated univariate resultants and discriminants over the integer universal ring of coefficients of the entry polynomials. Cases involving from two to four generic polynomials and resultants or discriminants in one of their variables are treated. The decompositions into irreducible factors we get are obtained by exploiting fundamental properties of the univariate resultants and discriminants and induction on the degree of the polynomials. As a consequence, each irreducible factor can be separately and explicitly computed in terms of a certain multivariate resultant. With this approach, we also obtain as direct corollaries some results conjectured by Collins (1975) and McCallum (1999, 2001 preprint) which correspond to the case of polynomials whose coefficients are themselves generic polynomials in other variables. Finally, a geometric interpretation of the algebraic factorization of the iterated discriminant of a single polynomial is detailled.
References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2000): 13P05
  • Retrieve articles in all journals with MSC (2000): 13P05
Additional Information
  • Laurent Busé
  • Affiliation: GALAAD, INRIA, B.P. 93, 06902 Sophia Antipolis, France
  • Email: Laurent.Buse@inria.fr
  • Bernard Mourrain
  • Affiliation: GALAAD, INRIA, B.P. 93, 06902 Sophia Antipolis, France
  • MR Author ID: 309750
  • Email: mourrain@sophia.inria.fr
  • Received by editor(s): December 19, 2006
  • Received by editor(s) in revised form: November 10, 2007
  • Published electronically: April 16, 2008
  • Additional Notes: This work was first presented at the conference in honor of Jean-Pierre Jouanolou, held at Luminy, Marseille, May 15–19, 2006

  • Dedicated: Dedicated to Professor Jean-Pierre Jouanolou
  • © Copyright 2008 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 78 (2009), 345-386
  • MSC (2000): Primary 13P05
  • DOI: https://doi.org/10.1090/S0025-5718-08-02111-X
  • MathSciNet review: 2448711