Files in this item
Complexity among the finitely generated subgroups of Thompson's group
Item metadata
dc.contributor.author | Bleak, Collin | |
dc.contributor.author | Brin, Matthew G. | |
dc.contributor.author | Moore, Justin Tatch | |
dc.date.accessioned | 2021-03-02T13:30:01Z | |
dc.date.available | 2021-03-02T13:30:01Z | |
dc.date.issued | 2021 | |
dc.identifier | 251767120 | |
dc.identifier | 15ebaae2-acd5-4655-9fc7-6e2d63f55b70 | |
dc.identifier | 000638255700001 | |
dc.identifier | 85105535942 | |
dc.identifier.citation | Bleak , C , Brin , M G & Moore , J T 2021 , ' Complexity among the finitely generated subgroups of Thompson's group ' , Journal of Combinatorial Algebra , vol. 5 , no. 1 , pp. 1-58 . https://doi.org/10.4171/JCA/49 | en |
dc.identifier.issn | 2415-6302 | |
dc.identifier.other | ArXiv: http://arxiv.org/abs/1711.10998v1 | |
dc.identifier.other | ORCID: /0000-0001-5790-1940/work/92371880 | |
dc.identifier.uri | https://hdl.handle.net/10023/21538 | |
dc.description | Funding: Acknowledgements. The authors would also like to thank the referee for their very careful and thorough reading of the paper. This publication is in part a product of a visit of the first and third author to the Mathematisches Forschungsinstitut Oberwolfach, Germany in December 2016 as part of their Research In Pairs program. The third author was partially supported by NSF grants DMS–1600635 and DMS-1854367. | en |
dc.description.abstract | We demonstrate the existence of a family of finitely generated subgroups of Richard Thompson’s group F which is strictly well-ordered by the embeddability relation of type ε0 + 1. All except the maximum element of this family (which is F itself) are elementary amenable groups. In fact we also obtain, for each α < ε0, a finitely generated elementary amenable subgroup of F whose EA-class is α + 2. These groups all have simple, explicit descriptions and can be viewed as a natural continuation of the progression which starts with Z + Z, Z wr Z, and the Brin-Navas group B. We also give an example of a pair of finitely generated elementary amenable subgroups of F with the property that neither is embeddable into the other. | |
dc.format.extent | 58 | |
dc.format.extent | 486587 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Combinatorial Algebra | en |
dc.subject | Elementary amenable | en |
dc.subject | Elementary group | en |
dc.subject | Geometrically fast | en |
dc.subject | Homeomorphism group | en |
dc.subject | Ordinal | en |
dc.subject | Pean arithmetic | en |
dc.subject | Piecewise linear | en |
dc.subject | Thompson's group | en |
dc.subject | Transition chain | en |
dc.subject | QA Mathematics | en |
dc.subject | Algebra and Number Theory | en |
dc.subject | Discrete Mathematics and Combinatorics | en |
dc.subject | T-NDAS | en |
dc.subject | BDU | en |
dc.subject.lcc | QA | en |
dc.title | Complexity among the finitely generated subgroups of Thompson's group | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. School of Mathematics and Statistics | en |
dc.contributor.institution | University of St Andrews. Pure Mathematics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.4171/JCA/49 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://arxiv.org/abs/1711.10998 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.