Back to Search
Start Over
On the asynchronous rational group
- Publication Year :
- 2017
- Publisher :
- arXiv, 2017.
-
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.<br />Comment: 12 pages, 3 figures
- Subjects :
- Asynchronous automaton
Theoretical computer science
010102 general mathematics
Rational group
0102 computer and information sciences
Group Theory (math.GR)
Simple groups
Automaton group
01 natural sciences
Mathematics::Group Theory
010201 computation theory & mathematics
Asynchronous communication
Asynchronous automata
Simple group
FOS: Mathematics
Discrete Mathematics and Combinatorics
Finite generation
Geometry and Topology
0101 mathematics
20F65 (Primary) 20E32, 20F05, 20F10, 68Q70 (Secondary)
Mathematics - Group Theory
Mathematics
Subjects
Details
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....19a73aa85753ed1363cfaafea7ef4211
- Full Text :
- https://doi.org/10.48550/arxiv.1711.01668