Polynomial-time algorithm for Hilbert series of Borel type ideals

In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal. Keywords Hilbert series, Castelnuovo-Mumford regularity, Satiety, Gr¨obner bases, Complexity

• Type: Conference
• Year: 2007
• Where: ISSAC
• Authors: Amir Hashemi
• Keywords: Borel Type Ideal, Hilbert Series, ISSAC 2007, Keywords Hilbert Series