An FGLM-like algorithm for computing the radical of a zero-dimensional ideal

DOI10.1142/S0219498818500020zbMath1387.13061OpenAlexW2581943294MaRDI QIDQ4599692

Ferdinando Mora

Publication date: 4 January 2018

Published in: Journal of Algebra and Its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219498818500020

zbMATH Keywords

zero-dimensional idealBuchberger theoryFGLM-algorithmideal theoretical operations

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) General radicals and associative rings (16N80) Solving polynomial systems; resultants (13P15)

Related Items (3)

Deterministic normal position transformation and its applications ⋮ HELP: a sparse error locator polynomial for BCH codes ⋮ Degröbnerization: a political manifesto

Uses Software

• Kronecker
• ISOLATE

Cites Work

• 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
• On the computation of matrices of traces and radicals of ideals
• Some examples for solving systems of algebraic equations by calculating Gröbner bases
• Gröbner bases and primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Solving zero-dimensional systems through the rational univariate representation
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Isolated points, duality and residues
• Radical computations of zero-dimensional ideals and real root counting.
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Bezoutian and quotient ring structure
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Vector space bases associated to vanishing ideals of points
• Constructions in a Polynomial Ring Over the Ring of Integers
• Solving Polynomial Equation Systems
• Constructions in Algebra
• The Big Mother of all Dualities: Möller Algorithm
• Border basis representation of a general quotient algebra
• Generalized normal forms and polynomial system solving
• Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
• A Gröbner free alternative for polynomial system solving

This page was built for publication: An FGLM-like algorithm for computing the radical of a zero-dimensional ideal