NUMERICAL ALGORITHMS FOR DUAL BASES OF POSITIVE-DIMENSIONAL IDEALS

DOI10.1142/S0219498813500187zbMath1273.14127arXiv1201.2242OpenAlexW2962969688MaRDI QIDQ4928325

Robert Krone

Publication date: 11 June 2013

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

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

zbMATH Keywords

Hilbert functioncomputational algebraic geometryMacaulay2Macaulay dual spaceNumerical algebraic geometry

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) Computational aspects in algebraic geometry (14Q99)

Related Items

Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Noetherian operators in Macaulay2 ⋮ Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme ⋮ Eliminating dual spaces ⋮ Numerical algorithms for detecting embedded components ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals

Uses Software

• Macaulay2
• SINGULAR

Cites Work

• The theory of involutive divisions and an application to Hilbert function computations
• A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
• Unnamed Item
• Unnamed Item