Numerical computation of the Hilbert function and regularity of a zero dimensional scheme

DOI10.1007/978-1-4939-0626-0_6MaRDI QIDQ5261424zbMATH OpenOpenAlexFDO

Authors Zachary A. Griffin, Jonathan D. Hauenstein, Chris Peterson, Andrew J. Sommese

Publication date 3 July 2015

Published in Connections Between Algebra, Combinatorics, and Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4939-0626-0_6

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05)

Recommendations

• Computation of Hilbert functions
• Computing zero-dimensional schemes
• Numerical algorithms for dual bases of positive-dimensional ideals
• Hilbert functions and the Buchberger algorithm
• Approximate computation of zero-dimensional polynomial ideals

Cites work

• scientific article; zbMATH DE number 5245181 (Why is no real title available?)
• scientific article; zbMATH DE number 967945 (Why is no real title available?)
• A numerical local dimension test for points on the solution set of a system of polynomial equations
• Algorithm 921: alphaCertified: certifying solutions to polynomial systems
• Algorithm 931
• Computing the multiplicity structure in solving polynomial systems
• Isosingular sets and deflation
• Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
• Newton's method with deflation for isolated singularities of polynomial systems
• The closedness subspace method for computing the multiplicity structure of a polynomial system

Cited in

(11)

• Multi-graded Macaulay dual spaces
• Learning algebraic varieties from samples
• Numerical elimination and moduli space of vacua
• A Numerical Survey of the Floors of Various Hilbert Fundamental Domains
• Binomiality testing and computing sparse polynomials via witness sets
• Robust numerical algebraic geometry
• scientific article; zbMATH DE number 5654498 (Why is no real title available?)
• Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
• Eliminating dual spaces
• Probabilistic saturations and Alt's problem
• Computing zero-dimensional schemes

Describes a project that uses

Uses Software

• Algorithm 931

This page was built for publication: Numerical computation of the Hilbert function and regularity of a zero dimensional scheme

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