R\"over's Simple Group is of Type F∞
Abstract
We prove that Claas R\"over's Thompson-Grigorchuk simple group VG has type F∞. The proof involves constructing two complexes on which VG acts: a simplicial complex analogous to the Stein complex for V, and a polysimiplical complex analogous to the Farley complex for V. We then analyze the descending links of the polysimplicial complex, using a theorem of Belk and Forrest to prove increasing connectivity.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.