On the asynchronous rational group
From MaRDI portal
Abstract: We prove that the asynchronous rational group defined by Grigorchuk, Nekrashevych, and Sushchanskii is simple and not finitely generated. Our proofs also apply to certain subgroups of the rational group, such as the group of all rational bilipschitz homeomorphisms.
Recommendations
- On asymorphisms of groups
- scientific article; zbMATH DE number 4134286
- On asymptotic approximate groups of integers
- scientific article; zbMATH DE number 1525363
- scientific article; zbMATH DE number 850246
- On finite rational groups and related topics
- On asymptotic dimension of groups
- The group of asynchronous automata and rational homeomorphisms of the Cantor set
- scientific article; zbMATH DE number 1209829
- scientific article; zbMATH DE number 2084969
Cites work
- scientific article; zbMATH DE number 3326379 (Why is no real title available?)
- DEGREES OF GROWTH OF FINITELY GENERATED GROUPS, AND THE THEORY OF INVARIANT MEANS
- Higher dimensional Thompson groups.
- Rational embeddings of hyperbolic groups
- Some solvable automaton groups.
- Some undecidability results for asynchronous transducers and the Brin-Thompson group \(2V\)
- The Algebraic Simplicity of Certain Groups of Homeomorphisms
- The Generation of GL(n, Z) by Finite State Automata
Cited in
(6)- The group of asynchronous automata and rational homeomorphisms of the Cantor set
- Conjugate subgroups and overgroups of Vn
- Sufficient conditions for a group of homeomorphisms of the Cantor set to be two-generated
- Universal groups of cellular automata
- A class of rearrangement groups that are not invariably generated
- Rational embeddings of hyperbolic groups
This page was built for publication: On the asynchronous rational group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286352)