A signature-based algorithm for computing the nondegenerate locus of a polynomial system

DOI10.1016/j.jsc.2023.02.001arXiv2202.13784MaRDI QIDQ6108370

Pierre Lairez, Mohab Safey El Din, Christian Eder, Unnamed Author

Publication date: 29 June 2023

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

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

zbMATH Keywords

algorithmGröbner basisideal decomposition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Computational aspects and applications of commutative rings (13Pxx) Commutative algebra (13-XX)

Related Items (3)

A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Signature Gröbner bases in free algebras over rings ⋮ Axioms for a theory of signature bases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for computing triangular decomposition of polynomial systems
• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Basic principles of mechanical theorem proving in elementary geometries
• Gröbner bases and primary decomposition of polynomial ideals
• Elimination methods
• Direct methods for primary decomposition
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• An elimination method for polynomial systems
• Minimal primary decomposition and factorized Gröbner bases
• The Magma algebra system. I: The user language
• Effective equidimensional decomposition of affine varieties
• A survey on signature-based algorithms for computing Gröbner bases
• Effective localization using double ideal quotient and its implementation
• On the theories of triangular sets
• Change of order for regular chains in positive dimension
• Computations modulo regular chains
• A new incremental algorithm for computing Groebner bases
• Julia: A Fresh Approach to Numerical Computing
• Signature rewriting in gröbner basis computation
• A new framework for computing Gröbner bases
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Comprehensive Triangular Decomposition
• A Singular Introduction to Commutative Algebra
• 3264 Conics in a Second
• Practical Gröbner basis computation
• Lifting techniques for triangular decompositions
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
• A Gröbner free alternative for polynomial system solving

This page was built for publication: A signature-based algorithm for computing the nondegenerate locus of a polynomial system