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

All of RECERCAT

dc.contributor.author	Belk, James
dc.contributor.author	Matucci, Francesco
dc.date	2016
dc.identifier	https://ddd.uab.cat/record/160580
dc.identifier	urn:10.5565/PUBLMAT_60216_07
dc.identifier	urn:oai:ddd.uab.cat:160580
dc.identifier	urn:oai:raco.cat:article/311018
dc.identifier	urn:articleid:20144350v60n2p501
dc.identifier	urn:wos_id:000379424100007
dc.identifier	urn:scopus_id:85047290183
dc.format	application/pdf
dc.language	eng
dc.publisher
dc.relation	;
dc.relation	Publicacions matemàtiques ; Vol. 60 Núm. 2 (2016), p. 501-524
dc.rights	open access
dc.rights	Tots els drets reservats.
dc.rights	https://rightsstatements.org/vocab/InC/1.0/
dc.subject	Thompson's groups
dc.subject	Grigorchuk's group
dc.subject	Finiteness properties
dc.subject	Polysimplicial complex
dc.title	Röver's simple group is of type F ∞
dc.type	Article
dc.description.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.