SearcharxivSearch

arXiv · 1608.00933

FPn properties of generalized Houghton groups

Abstract

This Thesis presents a 2-dimensional generalization of Houghtons' groups H_n. H_n is defined to be the group of all permutations p of a disjoint union of copies of the natural numbers N, with the property that each copy of N contains a cofinite subset on which p restricts to a translation. Our group G(n) is defined to be the group of all permutations p of a disjoint union of quadrants (i.e., copies of NxN) with the property that each quadrant contains a subquadrant on which p is a translation, while p restricted to the remaining set is piecewise isometric on a cofinite disjoint union of rays (each isometric to N). Based on K.S. Brown's treatment of the Houghton group case it is shown that G(n) is of type FP(n-1); in fact, that G(n) contains a normal subgroup N with G(n)/N = Z^(n-1) which is of type FP(n-1) and not FPn.

Explore related subjects

Keep this discovery

BibTeXRIS

Heike Sach. 2016-07-23. FPn properties of generalized Houghton groups. https://arxiv.org/abs/1608.00933

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR