Macaulay style formulas for sparse resultants

DOI10.1090/S0002-9947-02-02910-0zbMath0987.13019arXivmath/0107181MaRDI QIDQ2782655

Carlos D'Andrea

Publication date: 8 April 2002

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0107181

zbMATH Keywords

computing the resultant of sparse polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomials, factorization in commutative rings (13P05)

Related Items

A package for computations with sparse resultants, The resultant of an unmixed bivariate system, Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation, On the Mahler measure of resultants in small dimensions, Numerical root finding via Cox rings, Implicitization of curves and (hyper)surfaces using predicted support, Linear sparse differential resultant formulas, Sparse resultants and straight-line programs, The Canny-Emiris conjecture for the sparse resultant, Differential elimination by differential specialization of Sylvester style matrices, Resultant elimination via implicit equation interpolation, Implicitization of tensor product surfaces via virtual projective resolutions, Sparse difference resultant, Elimination theory in differential and difference algebra, Computing multihomogeneous resultants using straight-line programs, Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems, Elimination for generic sparse polynomial systems, Hybrid sparse resultant matrices for bivariate polynomials, Improved algorithms for computing determinants and resultants, Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants, Implicit representations of high-codimension varieties, Explicit factors of some iterated resultants and discriminants, New bounds and an efficient algorithm for sparse difference resultants, Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials, Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials, Rational univariate reduction via toric resultants, A Poisson formula for the sparse resultant, Sparse differential resultant for Laurent differential polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalised characteristic polynomials
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Résolution des systèmes d'équations algébriques
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Chow polytopes and general resultants
• Multigraded resultants of Sylvester type
• On the Newton polytope of the resultant
• Product formulas for resultants and Chow forms
• Inertia forms and resultant: A formulary
• Sparse resultant under vanishing coefficients
• Matrices in elimination theory
• Solving degenerate sparse polynomial systems faster
• Sharp estimates for the arithmetic Nullstellensatz
• Introduction to Toric Varieties. (AM-131)
• Residues and Resultants
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Explicit formulas for the multivariate resultant.