On the computation of Hilbert-Poincaré series

DOI10.1007/BF01810852MaRDI QIDQ810595zbMATH OpenFDO

Authors Anna M. 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) 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) Multiplicity theory and related topics (13H15)

Recommendations

• Polynomial complexity for Hilbert series of Borel type ideals
• scientific article; zbMATH DE number 503187
• Hilbert functions and the Buchberger algorithm
• scientific article; zbMATH DE number 1220827
• Computation of Hilbert functions

Cites work

• scientific article; zbMATH DE number 3918515 (Why is no real title available?)
• scientific article; zbMATH DE number 3961783 (Why is no real title available?)
• scientific article; zbMATH DE number 16596 (Why is no real title available?)
• scientific article; zbMATH DE number 16602 (Why is no real title available?)
• scientific article; zbMATH DE number 16647 (Why is no real title available?)
• scientific article; zbMATH DE number 193251 (Why is no real title available?)
• A theorem on refining division orders by the reverse lexicographic order
• Computing dimension and independent sets for polynomial ideals
• Hilbert functions of graded algebras
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
• New constructive methods in classical ideal theory
• The Gröbner fan of an ideal

Cited in

(15)

• Computation of Poincaré-Betti series for monomial rings
• Finding sparse systems of parameters
• Computation of Hilbert functions
• Computation of Hilbert-Poincaré series
• On computing Darboux type series analyses
• Hilbert series for ideals generated by generic forms
• Upper bounds for the betti numbers of a given hilbert function
• scientific article; zbMATH DE number 4108901 (Why is no real title available?)
• On the complexity of counting components of algebraic varieties
• A way of computing the Hilbert series
• Computation of Macaulay constants and degree bounds for Gröbner bases
• An algorithm for the hilbert-samuel function of a primary ideal
• On the Frobenius complexity of determinantal rings
• Polynomial complexity for Hilbert series of Borel type ideals
• scientific article; zbMATH DE number 3961026 (Why is no real title available?)

Describes a project that uses

Uses Software

• CoCoA

This page was built for publication: On the computation of Hilbert-Poincaré series

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