The conjugacy problem in Gl ( n, Z )

DOI10.1112/JLMS.12246zbMATH Open1456.20004arXiv1811.06190OpenAlexW2901489009WikidataQ127821112 ScholiaQ127821112MaRDI QIDQ5217907FDOQ5217907

Tommy Hofmann, E. A. O'Brien, B. Eick

Publication date: 26 February 2020

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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 $linN$, and then provide algorithms to solve the latter. The algorithms are practical and our implementations are publicly available in Magma.

Full work available at URL: https://arxiv.org/abs/1811.06190

Recommendations

• When are two elements of \(GL(2,\mathbb{Z}{})\) similar?
• Conjugacy Problem in GL 2 (Z[ √-1 ]) and Units of Quadratic Extensions of Q(√-1)
• Computation of lattice isomorphisms and the integral matrix similarity problem
• Conjugacy classes of torsion in GL_n(Z)
• Practical algorithms for polycyclic matrix groups

zbMATH Keywords

arithmetic groupalgorithms in group theorycentraliser problemintegral conjugacy problemMAGMA softwarerational conjugacy problem

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Algebraic number theory computations (11Y40) Finite simple groups and their classification (20D05) Computational methods for problems pertaining to group theory (20-08)

Cites Work

• The Magma algebra system. I: The user language
• Solution of the congruence subgroup problem for \(\text{SL}_ n\) \((n\geq 3)\) and \(\text{Sp}_{2n}\) \((n\geq 2)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some general algorithms. I: Arithmetic groups
• Advanced Topics in Computional Number Theory
• Title not available (Why is that?)
• Crystallographic algorithms and tables.
• Generators and relations for certain special linear groups
• Conjugacy Separability of Groups of Integer Matrices
• Title not available (Why is that?)
• Multidimensional Gauss reduction theory for conjugacy classes of \(\mathrm{SL}(n,\mathbb Z)\)
• Perfect lattices over imaginary quadratic number fields

Cited In (9)

• Computing base extensions of ordinary abelian varieties over finite fields
• Conjugacy Problem in GL 2 (Z[ √-1 ]) and Units of Quadratic Extensions of Q(√-1)
• Conjugacy classes of torsion in GL_n(Z)
• When are two elements of \(GL(2,\mathbb{Z}{})\) similar?
• Computation of lattice isomorphisms and the integral matrix similarity problem
• Title not available (Why is that?)
• The simultaneous conjugacy problem in the symmetric group
• On the similarity over the ring of integers of certain nilpotent matrices of maximal rank
• Disjoint pairs for \(\text{GL}_n (\mathbb R)\) and \(\text{GL}_n (\mathbb C)\)

Uses Software

• Magma

This page was built for publication: The conjugacy problem in \(\mathrm{ Gl } ( n, \mathbb{Z} )\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217907)