Abstract: We prove that Claas R"over's Thompson-Grigorchuk simple group has type . The proof involves constructing two complexes on which acts: a simplicial complex analogous to the Stein complex for , and a polysimiplical complex analogous to the Farley complex for . We then analyze the descending links of the polysimplicial complex, using a theorem of Belk and Forrest to prove increasing connectivity.
Recommendations
- On groups of type (FP)_
- On a Sufficient Condition when an Infinite Group Is not Simple
- scientific article; zbMATH DE number 703145
- Simple groups with infinite verbal width and the same positive theory as free groups
- Uncountably many groups of type FP
- M^*-simple groups
- The \(R_{\infty}\) property for Houghton's groups
- Semiprimitivity of Group Algebras of Infinite Simple Groups of Lie Type
- Solvable groups that are simple connected at \(\infty\)
- Soluble Groups of Type (FP)∞ have Finite Torsion-Free Rank
Cited in
(13)- Finiteness properties for relatives of braided Higman-Thompson groups
- The expansion set construction of classifying spaces for generalized Thompson groups
- The Brin-Thompson groups sV are of the type F_.
- Simple groups separated by finiteness properties
- Classification of finite fields with applications
- Cohomological finiteness properties of the Brin–Thompson–Higman groups 2V and 3V
- Twisted Brin-Thompson groups
- Finiteness properties of locally defined groups
- Almost-automorphisms of trees, cloning systems and finiteness properties
- Some isomorphism results for Thompson-like groups V_n(G)
- Finiteness properties of generalized Thompson groups via expansion sets
- Rearrangement groups of fractals
- Houghton-like groups from ``shift-similar groups
This page was built for publication: Röver's simple group is of type \(F_\infty\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739937)
