On Computing the Resultant of Generic Bivariate Polynomials

DOI10.1145/3208976.3209020zbMath1467.13061OpenAlexW2809375912WikidataQ131136603 ScholiaQ131136603MaRDI QIDQ5120221

Gilles Villard

Publication date: 9 September 2020

Published in: Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3208976.3209020

zbMATH Keywords

Toeplitz matrixcharacteristic polynomialdeterminantSylvester matrixbivariate resultantpolynomial structured matrix

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)

Related Items (8)

Chinese Remainder Theorem for bivariate lexicographic Gröbner bases ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ High-order lifting for polynomial Sylvester matrices ⋮ A fast randomized geometric algorithm for computing Riemann-Roch spaces ⋮ Fast computation of generic bivariate resultants ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one ⋮ Subalgebras in \(K[x\) of small codimension] ⋮ An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties

This page was built for publication: On Computing the Resultant of Generic Bivariate Polynomials