Generalized resultants over unirational algebraic varieties
In this paper, the authors present a new method based on Bezoutian matrices, to compute a non-trivial multiple of the resultant over a projective variety \(X\) described by a parametrization on an open subset. First, they recall the classical notion of resultant over a variety. Then, they consider the resultant in the case an open set of the variety \(X\) is parametrized. After recalling the construction of Bezoutian matrices and some of their properties, the authors show that, under some conditions, any maximal minor of the associated Bezoutian matrix is divisible by the resultant. Finally, some examples in MAPLE and applications are shown.
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Algorithms for residues and Łojasiewicz exponents
- Computing the isolated roots by matrix methods
- Factorization of polynomials over a finite field and the solution of systems of algebraic equations
- scientific article; zbMATH DE number 3941666 (Why is no real title available?)
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3494540 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 939806 (Why is no real title available?)
- scientific article; zbMATH DE number 939815 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 806917 (Why is no real title available?)
- Le formalisme du résultant. (The formalism of resultant)
- Multipolynomial resultant algorithms
- Multivariate subresultants
- Product formulas for resultants and Chow forms
- The \(q\)-numerical range of 3-by-3 weighted shift matrices
- Cayley-Dixon projection operator for multi-univariate composed polynomials
- Sparse resultant under vanishing coefficients
- Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
- Sparse resultant of composed polynomials. I: Mixed-unmixed case.
- Sparse resultant of composed polynomials. II: Unmixed-mixed case.
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- On the Bézout construction of the resultant
- Conic tangency equations and Apollonius problems in biochemistry and pharmacology
- Heuristics to sift extraneous factors in Dixon resultants
- Overdetermined systems of equations on toric, spherical, and other algebraic varieties
- Flexibility of Bricard's linkages and other structures via resultants and computer algebra
- Behavior of the fiber and the base points of parametrizations under projections
- Bezoutian and quotient ring structure
- Resultants of partially composed polynomials
- Heuristics to accelerate the Dixon resultant
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- scientific article; zbMATH DE number 16644 (Why is no real title available?)
- Surjectivity of the resultant map: a solution to the inverse bezout problem
- Algorithmic Search for Flexibility Using Resultants of Polynomial Systems
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- Image analysis: identification of objects via polynomial systems
- Resultant over the residual of a complete intersection.
- Intersection and self-intersection of surfaces by means of Bezoutian matrices
- Comparing acceleration techniques for the Dixon and Macaulay resultants
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)
