SearcharxivSearch

arXiv · 2405.03445

An elementary proof of the Benjamini-Nekrashevych-Pete conjecture for the semi-direct products $\mathbb{Z}^n\rtimes \mathbb{Z}$

Abstract

A finitely generated group $G$ is called strongly scale-invariant if there exists an injective homomorphism $f:G\to G$ such that $f(G)$ is a finite index subgroup of $G$ and such that $\cap_{n\geq 0} f^n(G)$ is finite. Nekrashevych and Pete conjectured that all strongly scale-invariant groups are virtually nilpotent, after disproving a stronger conjecture by Benjamini. This conjecture is known to be true in some situations. Der\'e proved it for virtually polycyclic groups. In this paper, we provide an elementary proof for those polycyclic groups that can be written as a semi-direct product $\mathbb{Z}^n\rtimes \mathbb{Z}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dean Wardell. 2024-05-06. An elementary proof of the Benjamini-Nekrashevych-Pete conjecture for the semi-direct products $\mathbb{Z}^n\rtimes \mathbb{Z}$. https://arxiv.org/abs/2405.03445

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