Computing ideals of points

DOI10.1006/jsco.2000.0411zbMath0977.13011OpenAlexW1982662469MaRDI QIDQ1588025

John Abbott, Lorenzo Robbiano, Martin Kreuzer, Anna Maria Bigatti

Publication date: 11 March 2001

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

Full work available at URL: https://doi.org/10.1006/jsco.2000.0411

zbMATH Keywords

Gröbner basisHilbert functionBuchberger-Möller algorithmCoCoAfinite set of pointsalgorithm over the rationals

Mathematics Subject Classification ID

Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Related Items

Finite sets of \(d\)-planes in affine space, The Big Mother of all Dualities: Möller Algorithm, On the Cohen-Macaulayness of the conormal module of an ideal, Vector space bases associated to vanishing ideals of points, Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm, Separators of fat points in \(\mathbb P^n\)., A computational algebra approach to the reverse engineering of gene regulatory networks, A two-dimensional improvement for Farr-Gao algorithm, Computing the state difference equations for discrete overdetermined linear \(m \operatorname{D}\) systems, Multiplication matrices and ideals of projective dimension zero, On the unique representation of very strong algebraic geometry codes, Small Gröbner fans of ideals of points, Computing zero-dimensional schemes, Fast amortized multi-point evaluation, Implicitization of hypersurfaces, Gröbner bases and generalized Padé approximation, Some Combinatorial Applications of Gröbner Bases, Geometric characterization of data sets with unique reduced Gröbner bases, A bivariate preprocessing paradigm for the Buchberger-Möller algorithm, Stable border bases for ideals of points, The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures, Approximate computation of zero-dimensional polynomial ideals, A short history of algebraic statistics, Degröbnerization: a political manifesto, Effective algorithm for computing Noetherian operators of zero-dimensional ideals

Uses Software

• CoCoA

Cites Work

• Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
• Efficient rational number reconstruction
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
• Cayley-Bacharach Schemes and Their Canonical Modules
• P-adic reconstruction of rational numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item