On the computation of Hilbert-Poincaré series

DOI10.1007/BF01810852zbMath0734.13016MaRDI QIDQ810595

Anna Maria Bigatti, Massimo Caboara, Lorenzo Robbiano

Publication date: 1991

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

Hilbert functionterm orderingBorel-normed idealcomplexity of the algorithmcomputation of Hilbert-Poincaré series

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multiplicity theory and related topics (13H15) 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

Finding sparse systems of parameters, Upper bounds for the betti numbers of a given hilbert function, Computation of Hilbert-Poincaré series, An algorithm for the hilbert-samuel function of a primary ideal, Computation of Macaulay constants and degree bounds for Gröbner bases, On the complexity of counting components of algebraic varieties

Uses Software

• CoCoA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New constructive methods in classical ideal theory
• A theorem on refining division orders by the reverse lexicographic order
• Computing dimension and independent sets for polynomial ideals
• The Gröbner fan of an ideal
• Hilbert functions of graded algebras
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases