ON THE USE OF GRAPHS FOR COMPUTING A BASIS, GROWTH AND HILBERT SERIES OF ASSOCIATIVE ALGEBRAS

DOI10.1070/SM1991v068n02ABEH001373zbMath0709.16012MaRDI QIDQ3491755

Victor Ufnarovski

Publication date: 1990

Published in: Mathematics of the USSR-Sbornik (Search for Journal in Brave)

zbMATH Keywords

wordsgrowthdirected graphfinite graphfree monoidmonomial algebraregular setsgrowth criterionautomaton algebrasrationality of the Hilbert seriesunitary algebra

Mathematics Subject Classification ID

Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Free semigroups, generators and relations, word problems (20M05) Paths and cycles (05C38) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Semigroup rings, multiplicative semigroups of rings (20M25) Computational aspects of associative rings (general theory) (16Z05)

Related Items

Graded algebras, algebraic functions, planar trees, and elliptic integrals ⋮ Context-free languages and associative algebras with algebraic Hilbert series ⋮ Artin-Schelter regular algebras of dimension five with two generators. ⋮ Finite automata of polynomial growth do not generate a free group. ⋮ Polynomial Identities of M_2,1(G) ⋮ Monomial algebras ⋮ The Noetherian property in some quadratic algebras