On the computation of Hilbert series and Poincaré series for algebras with infinite Gröbner bases

Månsson, Jonas (2000). On the computation of Hilbert series and Poincaré series for algebras with infinite Gröbner bases. Computer Science Journal of Moldova, 8, (1), 42 - 63
Download:
URL:
| Published | English
Authors:
Månsson, Jonas
Department:
Mathematics (Faculty of Engineering)
Algebra
Research Group:
Algebra
Abstract:
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.
ISSN:
1561-4042
LUP-ID:
cd5f17b5-6443-438a-b7a7-07809d28f87e | Link: https://lup.lub.lu.se/record/cd5f17b5-6443-438a-b7a7-07809d28f87e | Statistics

Cite this