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 S of partial transformations that ``locally determine" ; (2) an equivalence relation on certain pairs (f,D), and (3) an ``expansion" rule E. These choices determine an expansion set B, which is a combinatorial device that outputs a simplicial complex fB upon which acts. Under favorable conditions, often achieved in practice, fB is contractible, and the action of has small stabilizers. The definition of fB is such that ascending and descending links in fB can be described via formulas that depend only on the expansion rule E. 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 F∞. The net effect of our results is to automate results of this kind. Several applications are given; in particular, we sketch unified proofs that V, nV, R\"over's group G, and the Lodha-Moore group have type F∞.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…