Generalized resultants over unirational algebraic varieties

DOI10.1006/JSCO.1999.0304zbMATH Open0983.14039OpenAlexW2016691347MaRDI QIDQ1569828FDOQ1569828

Authors: Laurent Busé, Mohamed Elkadi, Bernard Mourrain 

Publication date: 28 September 2000

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00096842/file/main.pdf

Recommendations

• Resultants of determinantal varieties
• Matrices in elimination theory
• Fast computation of the Bézout and Dixon resultant matrices
• On the Bézout construction of the resultant
• On computing the resultant of generic bivariate polynomials

zbMATH Keywords

resultantBezoutian matricesparametrized varietiesunirational algebraic varieties

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Rational and unirational varieties (14M20) Computational aspects of algebraic surfaces (14Q10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Multipolynomial resultant algorithms
• Le formalisme du résultant. (The formalism of resultant)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the isolated roots by matrix methods
• Product formulas for resultants and Chow forms
• Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
• Factorization of polynomials over a finite field and the solution of systems of algebraic equations
• Algorithms for residues and Łojasiewicz exponents
• Title not available (Why is that?)
• Multivariate subresultants

Cited In (24)

• Heuristics to accelerate the Dixon resultant
• Behavior of the fiber and the base points of parametrizations under projections
• Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
• Flexibility of Bricard's linkages and other structures via resultants and computer algebra
• Comparing acceleration techniques for the Dixon and Macaulay resultants
• Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
• Bezoutian and quotient ring structure
• Intersection and self-intersection of surfaces by means of Bezoutian matrices
• Sparse resultant under vanishing coefficients
• Algebraic methods and arithmetic filtering for exact predicates on circle arcs
• Sparse resultant of composed polynomials. I: Mixed-unmixed case.
• Sparse resultant of composed polynomials. II: Unmixed-mixed case.
• Title not available (Why is that?)
• Constructing Sylvester-type resultant matrices using the Dixon formulation
• The \(q\)-numerical range of 3-by-3 weighted shift matrices
• Surjectivity of the resultant map: a solution to the inverse bezout problem
• Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
• Resultant over the residual of a complete intersection.
• Image analysis: identification of objects via polynomial systems
• Cayley-Dixon projection operator for multi-univariate composed polynomials
• Overdetermined systems of equations on toric, spherical, and other algebraic varieties
• Resultants of partially composed polynomials
• Conic tangency equations and Apollonius problems in biochemistry and pharmacology
• Heuristics to sift extraneous factors in Dixon resultants

Uses Software

• Maple

This page was built for publication: Generalized resultants over unirational algebraic varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569828)