Presentations of topological full groups by generators and relations (Q1702688)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Presentations of topological full groups by generators and relations
scientific article

    Statements

    Presentations of topological full groups by generators and relations (English)
    0 references
    0 references
    28 February 2018
    0 references
    Let \((\Omega,T)\) be a minimal subshift over a finite alphabet: \(\Omega\) is a closed subset of \(X^{\mathbb Z}\) for a finite alphabet \(X\), invariant under the shift map \(T\), and minimal under these conditions. The associated \textit{topological full group} is the group of self-homeomorphisms of \(\Omega\) that are piecewise powers of \(T\). It is a countable group, and the authors give a presentation of it by generators and relations. Under a technical restriction which can easily be accommodated with, the derived subgroup \(G'_{\Omega,T}\) of the topological full group is presented as follows: Let \(L(\Omega)=\{w\in X^* \text{ occurring in some element of } \Omega\}\) be the language of \(\Omega\); then \(G'_{\Omega,T}\) is generated by all elements \(x_{w,k}\) with \(w\in L(\Omega)\) and \(k\in\mathbb Z\), and is presented by an explicit and systematic list of relations that the \(x_{w,k}\) satisfy; in particular, if \(L(\Omega)\) is recursive, then their presentation is recursive. Recall the ``cylinder sets'' \((w,k)=\{\omega\in\Omega: \omega_{-k}\cdots\omega_{|w|-1-k}=w\}\) generating the topology of \(\Omega\); then the technical restrictions impose that the cylinders \((w,k)\), \((w,k+1)\) and \((w,k+2)\) are disjoint, and \(x_{w,k}\) acts by permuting them cyclically. Note that \textit{H. Matui} showed in [Int. J. Math. 17, No. 2, 231--251 (2006; Zbl 1109.37008)] that (under the same technical assumptions) \(G'_{\Omega,T}\) is generated by the finite set \(\{x_{w,1}:|w|=3\}\), and noted that it is not finitely presented.
    0 references
    finitely generated groups
    0 references
    presentations
    0 references
    generators
    0 references
    relations
    0 references
    full groups
    0 references
    symbolic dynamics
    0 references
    word problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references