Finiteness properties of generalized Thompson groups via expansion sets
Abstract
We outline a general procedure that builds classifying spaces for generalized Thompson groups . The construction depends on a small number of choices: (1) an inverse semigroup of partial transformations that ``locally determine" ; (2) an equivalence relation on certain pairs , and (3) an ``expansion" rule . These choices determine an \emph{expansion set} , which is a combinatorial device that outputs a simplicial complex upon which acts. Under favorable conditions, often achieved in practice, is contractible, and the action of has small stabilizers. The definition of is such that ascending and descending links in can be described via formulas that depend only on the expansion rule . The result is to facilitate the usual computations of the connectivity of the descending link. Under natural hypotheses, one can prove that the acting group has type . The net effect of our results is to automate results of this kind. Several applications are given; in particular, we sketch unified proofs that , , R\"{o}ver's group , and the Lodha-Moore group have type .
Keywords
Cite
@article{arxiv.2312.10211,
title = {Finiteness properties of generalized Thompson groups via expansion sets},
author = {Daniel Farley},
journal= {arXiv preprint arXiv:2312.10211},
year = {2024}
}
Comments
50 pages, 13 figures (The current version corrects Remark 4.12 and adds an acknowledgement at the end of the introduction. Otherwise, the paper is unchanged.)