SearcharxivSearch

arXiv · 2202.00822

Houghton-like groups from "shift-similar" groups

Abstract

We introduce and study \emph{shift-similar} groups $G\le\textrm{Sym}(\mathbb{N})$, which play an analogous role in the world of Houghton groups that self-similar groups play in the world of Thompson groups. We also introduce Houghton-like groups $H_n(G)$ arising from shift-similar groups $G$, which are an analog of R\"over-Nekrashevych groups from the world of Thompson groups. We prove a variety of results about shift-similar groups and these Houghton-like groups, including results about finite generation and amenability. One prominent result is that every finitely generated group embeds as a subgroup of a finitely generated shift-similar group, in contrast to self-similar groups, where this is not the case. This establishes in particular that there exist uncountably many isomorphism classes of finitely generated shift-similar groups, again in contrast to the self-similar situation.

Explore related subjects

Keep this discovery

BibTeXRIS

Brendan Mallery, Matthew C. B. Zaremsky. 2022-02-02. Houghton-like groups from "shift-similar" groups. https://arxiv.org/abs/2202.00822

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