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

James Belk , Francesco Matucci

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