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

DOI10.1142/S0219498818500020zbMATH Open1387.13061OpenAlexW2581943294MaRDI QIDQ4599692FDOQ4599692

Authors: 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

Recommendations

• On radical zero-dimensional ideals
• An algorithm for the computation of the radical of an ideal
• Linear Algebra for Zero-Dimensional Ideals
• Computing the primary decomposition of zero-dimensional ideals
• scientific article

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) Solving polynomial systems; resultants (13P15) General radicals and associative rings (16N80)

Cites Work

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

Cited In (5)

• Deterministic normal position transformation and its applications
• Oracle-supported drawing of the Gröbner \textit{escalier}
• HELP: a sparse error locator polynomial for BCH codes
• On radical zero-dimensional ideals
• Degröbnerization: a political manifesto

Uses Software

• Kronecker
• ISOLATE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599692)