Abstract
We prove that Claas Röver'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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.