On the asynchronous rational group (Q2286352)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the asynchronous rational group |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the asynchronous rational group |
scientific article |
Statements
On the asynchronous rational group (English)
0 references
22 January 2020
0 references
In this article, the authors study a group of homeomorphisms of the Cantor set introduced by \textit{R. I. Grigorchuk} et al. [in: Dynamical systems, automata, and infinite groups. Transl. from the Russian. Moscow: MAIK Nauka/Interperiodica Publishing. 128--203 (2000; Zbl 1155.37311); translation from Tr. Mat. Inst. Steklova 231, 134--214 (2000)] and called the ``asynchronous rational group''. They prove that this group is simple but not finitely generated. Their method also applies to study certain subgroups of this group. In the last 15 years, there has been an intense activity around the study of certain countable subgroups of the group of homeomorphisms of the Cantor set. Many groups with interesting properties (e.g. simplicity combined with other properties) have been constructed, see e.g. [\textit{H. Matui}, Int. J. Math. 17, No. 2, 231--251 (2006; Zbl 1109.37008); \textit{K. Juschenko} and \textit{N. Monod}, Ann. Math. (2) 178, No. 2, 775--787 (2013; Zbl 1283.37011); \textit{V. Nekrashevych}, Ann. Math. (2) 187, No. 3, 667--719 (2018; Zbl 1437.20038)] for further reading (among many other interesting articles).
0 references
asynchronous automata
0 references
automaton groups
0 references
simple groups
0 references
finite generation
0 references
0 references
0 references
0.86623216
0 references
0.8634417
0 references
0 references
0.86238396
0 references