skip to content

Conjugacy problems in GL(n,Z)

Presented by: 
Bettina Eick
Thursday 30th January 2020 - 11:30 to 12:20
INI Seminar Room 1
The talk describes a practical algorithm to solve the conjugacy and the centralizer problems in GL(n,Z) in full generality; that is, given two matrices A and B in GL(n,Q) these algorithms allow to check if A and B are conjugate in GL(n,Z) and, if so, then to determine a conjugating element, and they allow to compute generators for the centralizer of A in GL(n,Z).  The talk also discusses possible extensions of this algorithm to finitely generated abelian or nilpotent subgroups of GL(n,Z). The latter are open problems in computational group theory and they have interesting applications.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons