No label defined (Q3469291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4136232
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4136232 |
Statements
1990
0 references
finitely generated algebra
0 references
finite generating set
0 references
growth function
0 references
semigroups
0 references
growth series
0 references
enumeration of words
0 references
monoids
0 references
free quasigroups
0 references
free loops
0 references
0.8280144333839417
0 references
0.8092095851898193
0 references
0.8061420917510986
0 references
0.80454421043396
0 references
[For the entire collection see Zbl 0688.00005.] Let A be a finitely generated algebra and let G be a finite generating set for A. For each natural n put \(\gamma_{A,G}(n)\) to be the number of distinct elements of A that can be represented by a word on G containing not more than n occurences of elements of G; then \(\gamma_{A,G}(n)\) is the growth function of A relative to G. The exact growth function of A relative to G is \(\epsilon_{A,G}(n)=\gamma_{A,G}(n)-\gamma_{A,G}(n- 1)\), and the growth series of A relative to G is \(\sum^{\infty}_{n=0}\epsilon_{A,G}(n)z^ n\). A rationality result of the growth series is shown for semigroups and groups. The explicit calculation of the growth series of algebras defined by rewrite-complete sets of identities and relations is obtained by reducing it to an enumeration of words not containing certain subwords. Special attention is paid to monoids, some groupoids, free quasigroups and free loops.
0 references