2014/05/21 by Robert Krone, Krone, Robert
Computer Science · Mathematics · #14Q99 #68N01 #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Computer and information sciences #FOS: Mathematics #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.SC #math.AC #math.AG #msc:14Q99 #msc:68N01
paper · pdf · doi:10.48550/arxiv.1405.5293
5 pages
arxiv created 2014/05/21 · openalex publication_date 2014/05/21 · arxiv updated 2014/05/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used with floating point arithmetic over the complex numbers. They provide a viable alternative in this setting to purely symbolic methods such as standard bases. In particular, these methods can be used to compute initial ideals, local Hilbert functions and Hilbert regularity.