Computing zero-dimensional schemes

DOI10.1016/j.jsc.2004.09.001zbMath1120.13027OpenAlexW1982098398MaRDI QIDQ2456531

Martin Kreuzer, Lorenzo Robbiano, John Abbott

Publication date: 19 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.09.001

zbMATH Keywords

fat pointsGröbner basis algorithmzero-dimensional schemes

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Finite sets of \(d\)-planes in affine space, Multiplication matrices and ideals of projective dimension zero, Small Gröbner fans of ideals of points, Implicitization of hypersurfaces, Using semicontinuity for standard bases computations

Uses Software

• CoCoA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing toric ideals
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Minimally generating ideals of points in polynomial time using linear algebra
• Computing ideals of points
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Families of estimable terms
• Computation of minimal generators of ideals of fat points
• On the Canonical Module of A 0-Dimensional Scheme