On the asynchronous rational group
classification
🧮 math.GR
keywords
grouprationalasynchronousapplybilipschitzcertaindefinedfinitely
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.