Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one

DOI10.1016/j.jsc.2021.10.001OpenAlexW3208227711MaRDI QIDQ2066949

Xavier Dahan

Publication date: 17 January 2022

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

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

zbMATH Keywords

lexicographic orderGröbner basissubresultantdynamic evaluation

Mathematics Subject Classification ID

Related Items (3)

Chinese Remainder Theorem for bivariate lexicographic Gröbner bases ⋮ p-adic algorithm for bivariate Gröbner bases ⋮ Elimination ideal and bivariate resultant over finite fields

Uses Software

• Kronecker
• Magma
• PHCpack
• RegularChains
• Bertini
• modpn
• ISOLATE

Cites Work

• A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
• Solving bivariate systems using rational univariate representations
• Bivariate triangular decompositions in the presence of asymptotes
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
• On the asymptotic and practical complexity of solving bivariate systems over the reals
• Gröbner bases and primary decomposition of polynomial ideals
• Elimination methods
• Solving zero-dimensional systems through the rational univariate representation
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• The Magma algebra system. I: The user language
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Ideal basis and primary decompositions: case of two variables
• A remark on a remark by Macaulay or enhancing Lazard structural theorem
• Algebraic numbers: An example of dynamic evaluation
• Fast computation of generic bivariate resultants
• Directed evaluation
• Multiplicity-preserving triangular set decomposition of two polynomials
• On the connection between Ritt characteristic sets and Buchberger-Gröbner bases
• An improved upper complexity bound for the topology computation of a real algebraic plane curve
• Numerical stability of Euclidean algorithm over ultrametric fields
• The lex game and some applications
• On Fulton’s Algorithm for Computing Intersection Multiplicities
• Modular dynamic evaluation
• A Fast Algorithm for Computing the Truncated Resultant
• A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve
• Multivariate Polynomial Factorization
• Algorithm 795
• On the Bit-Size of Non-radical Triangular Sets
• Sharp estimates for triangular sets
• Gcd Modulo a Primary Triangular Set of Dimension Zero
• On Computing the Resultant of Generic Bivariate Polynomials
• Algorithms for computing triangular decompositions of polynomial systems
• A Gröbner free alternative for polynomial system solving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one