Functionally recursive rings of matrices -- two examples (Q848527)

Let \(Y\) be a finite alphabet of size \(m\) and let \(S\) be the free monoid consisting of all words on \(Y.\) For any field \(k\) we can consider the monoid ring \(V:=kS\) which is a \(k\)-algebra with basis \(S\) and multiplication determined by the multiplication (concatenation) in \(S\). Let \(V_{n}\) be the homogeneous subspace of \(V\) whose basis is the set of words of length \(n\), and let \(E\) be the ring of endomorphisms of \(V\) which map each \(V_{n}\) into itself. We can write \(V\) recursively in the form \(V=k1\oplus\sum_{y\in Y}yV\). Then over a suitable basis each element of \(E\) can be represented by a block diagonal matrix of the form \(diag(\alpha,L)\) where \(\alpha\in k\) and \(L\) is an \(m\times m\) block whose entries are in turn matrices representing elements of \(E.\) This enables us to give concise descriptions of some elements of \(E\) using a form which the author calls ``functionally recursive''. The author uses these ideas to construct interesting examples of rings such as the following. For \(m=2\) define \[ s:=\left[ \begin{matrix} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & 2s \end{matrix} \right] \text{ and }t:=\left[ \begin{matrix} 0 & 0 & 0\\ 0 & 0 & 2s\\ 0 & 0 & 2t \end{matrix} \right] . \] Then \(s\) and \(t\) are functionally recursive of exponential growth and the ring which they generate is freely generated. A more complicated example provides two elements \(s^{\prime}\) and \(t^{\prime}\) such that: (i) the ring generated by \(s^{\prime}\) and \(t^{\prime}\) is monomial; (ii) the semigroup generated by \(s^{\prime}\) and \(t^{\prime}\) is nil of degree \(5\); and (iii) the ring has Gelfand-Kirilov dimension \(1+\log(2)/\log(\frac{1}{2}(1+\sqrt{5}))\).