go-v.orgdoi

Complexity among the finitely generated subgroups of Thompson's group

Collin Bleak, Matthew G. Brin, Justin Tatch Moore · Journal of Combinatorial Algebra · 2021

  • DOI 10.4171/jca/49
  • Publisher EMS Press
  • Type article
  • Issued 2021

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

Journal of Combinatorial Algebra · EMS Press · article · 2021

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 \epsilon_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 \alpha < \epsilon_0 , a finitely generated elementary amenable subgroup of F whose EA-class is \alpha + 2 . These groups all have simple, explicit descriptions and can be viewed as a natural continuation of the progression which starts with \mathbf Z + \mathbf Z , \mathbf Z \wr \mathbf 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.

Open the resolved locator · 10.4171/jca/49

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 03:17 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://ems.press/journals/jca/articles/666343
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.