An algorithm for the hilbert-samuel function of a primary ideal

DOI10.1080/00927879508825316zbMath0827.13016OpenAlexW2099659811MaRDI QIDQ4834881

Ferdinando Mora, Maria Evelina Rossi

Publication date: 18 December 1995

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927879508825316

zbMATH Keywords

standard basisHilbert-Samuel functionalgorithm for Poincaré-Samuel series

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)

Related Items (2)

An algorithm for computing the Hilbert-Samuel multiplicities and reductions of zero-dimensional ideals of Cohen-Macaulay local rings ⋮ CSSg method for several genericities of parametric systems

Cites Work

• Unnamed Item
• Unnamed Item
• On the computation of Hilbert-Poincaré series
• La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
• Computation of Hilbert functions
• Ideals whose Hilbert function and Hilbert polynomial agree at \(n=1\)

This page was built for publication: An algorithm for the hilbert-samuel function of a primary ideal