Röver's simple group is of type F ∞

• Autores: James Belk , Francesco Matucci
• Localización: Publicacions matematiques, ISSN 0214-1493, Vol. 60, Nº 2, 2016, págs. 501-524
• Idioma: inglés
• DOI: 10.5565/10.5565-PUBLMAT_60216_07
• Enlaces
  • Texto completo  1    2  
• Resumen

  • 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.