scientific article; zbMATH DE number 493146
exponential growthfinitely generated free monoidsfinitely generated monomial algebrasfinitely presented monomial algebrasGel'fand-Kirillov dimensionHilbert serieslinearly bounded growthmonoid algebrasoverlap graphspolynomially bounded growthwords
Paths and cycles (05C38) Growth rate, Gelfand-Kirillov dimension (16P90) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Ordinary and skew polynomial rings and semigroup rings (16S36) Free semigroups, generators and relations, word problems (20M05) Semigroup rings, multiplicative semigroups of rings (20M25)
A finitely generated monomial algebra over a field \(K\) is a monoid algebra \(A=K[F/R]\), where \(F\) is a finitely generated free monoid and \(R\) is a monoid ideal. \(A\) is finitely presented if \(R\) is finitely generated. It is customary to identify \(B=F\setminus R\) with a \(K\)-basis of \(A\). It was first realized by \textit{V. A. Ufnarovskij} [Mat. Zametki 31, 465-472 (1982; Zbl 0491.05041)] that the growth of \(A\) can be described in terms of the growth of a graph. Specifically, the overlap graph \(\Gamma_n\) has as its vertices the set of words in \(B\) of length \(n\), and an arrow is drawn from \(u\) to \(v\) if there exist letters \(a\) and \(b\) such that \(ua=bv\in B\). The Hilbert (Poincaré) series for \(A\) is the formal sum \(\sum^\infty_{n=0} h_n t^n\), where \(h_n\) is the number of vertices in \(\Gamma_n\). The author proves that the algebra \(A\) has linearly bounded growth if and only if the sequence of the coefficients of its Hilbert series is eventually periodic, which is shown to happen if and only if the sequence of the overlap graphs is eventually periodic. The paper also establishes the following generalization of Bergman's result that no \(K\)-algebra exists whose Gel'fand-Kirillov dimension is strictly between 1 and 2: If for some \(d\geq 2\) and \(i\geq 0\), \(B\) contains at most \(d+i\) words of length \(d\), and if \(\Gamma_d\) is faithful (that is, for each \(j\geq 0\) there is a one-to-one correspondence between words in \(B\) of length \(d+j\) and paths in \(\Gamma_d\) with \(j\) arrows), then the growth of \(A\) is either exponential, or else is bounded by a polynomial of degree \(i+1\). Examples are provided to show that the hypothesis that \(A\) be finitely presented is necessary for these results to hold. For the entire collection see [Zbl 0780.00030].
- Primitive algebras with arbitrary Gelfand-Kirillov dimension
- Graphs and Bergman's GK gap theorem
- Rational growth and degree of commutativity of graph products
- Growth alternative for Hecke-Kiselman monoids
- Monomial algebras defined by Lyndon words.
- Growth functions of finitely generated algebras.
- A generalized Ufnarovski graph
- scientific article; zbMATH DE number 3927142 (Why is no real title available?)
- On Algebras With Gelfand-Kirillov Dimension One
- scientific article; zbMATH DE number 4122153 (Why is no real title available?)
- Degree growth of monomial maps and McMullen's polytope algebra
- Graph expansions of unipotent monoids
- scientific article; zbMATH DE number 5064444 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276399)