The conjugacy problem in $GL(n,Z)$

Bettina Eick; Tommy Hofmann; E. A. O'Brien

Home/Archive/arXiv

arXiv · 1811.06190

The conjugacy problem in $GL(n,Z)$

Bettina Eick·Tommy Hofmann·E. A. O'Brien

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in $GL(n,Z)$ of a matrix in $GL(n,Q)$. We do this by reducing these problems respectively to the isomorphism and automorphism group problems for certain modules over rings of the form $\mathcal O_K[y]/(y^l)$, where $\mathcal O_K$ is the maximal order of an algebraic number field and $l \in N$, and then provide algorithms to solve the latter. The algorithms are practical and our implementations are publicly available in Magma.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Bettina Eick, Tommy Hofmann, E. A. O'Brien. 2018-11-15. The conjugacy problem in $GL(n,Z)$. https://arxiv.org/abs/1811.06190

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗