SearcharxivSearch

arXiv · 2604.06968

A criterion for Tits alternative on the centralizer of a matrix

Abstract

We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix ensuring that it is abelian. This can be thought of as an effective Tits alternative on centralizers in $\sf{GL}(n,\mathbb{Z})$. We apply these criteria to the conjugacy problem in certain arithmetic groups preserving a non-degenerate $\mathbb{Q}$-bilinear form, such as integral symplectic groups. We derive an effective solution to the conjugacy problem in such groups when given matrices satisfy the above criterion. This solution is based on effective solutions to the conjugacy problem in $\sf{GL}(n,\mathbb{Z})$ by Eick-Hofmann-O'Brien and to an orbit problem for polycyclic groups, by Eick and Ostheimer.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Adem Zeghib. 2026-04-08. A criterion for Tits alternative on the centralizer of a matrix. https://arxiv.org/abs/2604.06968

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