Chinese Remainder Theorem for bivariate lexicographic Gröbner bases

DOI10.1145/3597066.3597082OpenAlexW4383213639MaRDI QIDQ6060370

Xavier Dahan

Publication date: 3 November 2023

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

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

zbMATH Keywords

lexicographic orderGröbner basisChinese remainder theorembivariate

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• On decomposing systems of polynomial equations with finitely many solutions
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Ideal basis and primary decompositions: case of two variables
• A remark on a remark by Macaulay or enhancing Lazard structural theorem
• Fast computation of generic bivariate resultants
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• The lex game and some applications
• The vanishing ideal of a finite set of closed points in affine space
• Size of coefficients of lexicographical Groöbner bases
• Factoring into coprimes in essentially linear time
• Fast Reduction of Bivariate Polynomials with Respect to Sufficiently Regular Gröbner Bases
• On Computing the Resultant of Generic Bivariate Polynomials
• Change of Basis for m-primary Ideals in One and Two Variables
• Elimination ideal and bivariate resultant over finite fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chinese Remainder Theorem for bivariate lexicographic Gröbner bases