IMCS/Publications/CSJM/Issues/CSJM v.8, n.1 (22), 2000/

On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases

Authors: Jonas Mansson


In this paper we present algorithms to compute finite state automata which, given any rational language, recognize the languages of normal words and n-chains. We also show how these automata can be used to compute the Hilbert series and Poincaré series for any algebra with a rational set of leading words of its minimal Gröbner basis.

Jonas Mansson,
Lund University,
Department of Mathematics
Solvegatan, 18,
Box 118, S-22100,
Lund, Sweden


Adobe PDF document0.21 Mb