On the computation of Hilbert-Poincaré series
DOI10.1007/BF01810852zbMATH Open0734.13016MaRDI QIDQ810595FDOQ810595
Anna M. Bigatti, Massimo Caboara, Lorenzo Robbiano
Publication date: 1991
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Recommendations
- Polynomial complexity for Hilbert series of Borel type ideals
- [[:Publication:4279508|Title not available (Why is that?)]]
- Hilbert functions and the Buchberger algorithm
- [[:Publication:4219627|Title not available (Why is that?)]]
- Computation of Hilbert functions
Hilbert functionterm orderingBorel-normed idealcomplexity of the algorithmcomputation of Hilbert-Poincaré series
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)
Cites Work
- Hilbert functions of graded algebras
- Title not available (Why is that?)
- A theorem on refining division orders by the reverse lexicographic order
- Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
- The Gröbner fan of an ideal
- Title not available (Why is that?)
- New constructive methods in classical ideal theory
- Computing dimension and independent sets for polynomial ideals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Finding sparse systems of parameters
- Computation of Hilbert functions
- Computation of Hilbert-Poincaré series
- On computing Darboux type series analyses
- Upper bounds for the betti numbers of a given hilbert function
- Hilbert series for ideals generated by generic forms
- On the complexity of counting components of algebraic varieties
- 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
- Title not available (Why is that?)
Uses Software
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)