SearcharxivSearch

arXiv · 2004.00586

Arithmeticity of groups $\mathbb Z^n\rtimes\mathbb Z$

Abstract

We study when the group $\mathbb Z^n\rtimes_A\mathbb Z$ is arithmetic where $A\in GL_n(\mathbb Z)$ is hyperbolic and semisimple. We begin by giving a characterization of arithmeticity phrased in the language of algebraic tori, building on work of Grunewald-Platonov. We use this to prove several more concrete results that relate the arithmeticity of $\mathbb Z^n\rtimes_A\mathbb Z$ to the reducibility properties of the characteristic polynomial of $A$. Our tools include algebraic tori, representation theory of finite groups, Galois theory, and the inverse Galois problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Bena Tshishiku. 2020-04-01. Arithmeticity of groups $\mathbb Z^n\rtimes\mathbb Z$. https://arxiv.org/abs/2004.00586

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