论文信息 - On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases

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

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 Poincare series for any algebra with a rational set of leading words of its minimal Grobner basis.

Jonas Månsson

[1] Vladimir Drobot,et al. Formal Languages and Automata Theory , 2014 .

[2] V A Ufnarovskiĭ,et al. ON THE USE OF GRAPHS FOR COMPUTING A BASIS, GROWTH AND HILBERT SERIES OF ASSOCIATIVE ALGEBRAS , 1991 .

[3] G. Bergman. The diamond lemma for ring theory , 1978 .

[4] D. Anick,et al. On the homology of associative algebras , 1986 .

[5] J. Shearer. A graded algebra with a non-rational Hilbert series , 1980 .

[6] Patrik Nordbeck,et al. Canonical bases for subalgebras of factor algebras , 1999, Comput. Sci. J. Moldova.

[7] V. A. Ufnarovskij. Combinatorial and Asymptotic Methods in Algebra , 1995 .