Home > Articles > Published articles > Röver's simple group is of type F ∞ |
Date: | 2016 |
Abstract: | We prove that Claas Röver's Thompson-Grigorchuk simple group V G has type F∞. The proof involves constructing two complexes on which V G acts: a simplicial complex analogous to the Stein complex for V , and a polysimplicial 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. |
Rights: | Tots els drets reservats. |
Language: | Anglès |
Document: | Article ; recerca ; Versió publicada |
Subject: | Thompson's groups ; Grigorchuk's group ; Finiteness properties ; Polysimplicial complex |
Published in: | Publicacions matemàtiques, Vol. 60 Núm. 2 (2016) , p. 501-524 (Articles) , ISSN 2014-4350 |
24 p, 406.6 KB |