Polynomial Complexity for Hilbert Series of Borel Type Ideals

Amir Hashemi (1)

1 SPIRAL - Systèmes Polynomiaux, Implantation, Résolution Algébrique

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 $D^n$ where $n + 1$ is the number of unknowns and $D$ is the highest degree of a minimal generator of input (monomial) ideal.

Domaines: Informatique [cs]

Amir Hashemi. Polynomial Complexity for Hilbert Series of Borel Type Ideals. Albanian Journal of Mathematics, 2007, 1 (3), pp.145-155. ⟨hal-01148709⟩