University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Conjugacy problems in GL(n,Z)

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Conjugacy problems in GL(n,Z)

Download to your calendar using vCal

If you have a question about this talk, please contact INI IT .

GRAW02 - Computational and algorithmic methods

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.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Babbage Seminar Series Electrical Engineering, 9 JJ Thomson Avenue, Cambridge, CB3 0FA. GS1, Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ

Other talks

FILM: One With The Whale Title and abstract tba Using Light for Cancer Detection Online Causal Inference Seminar Morning Tea and Coffee Online Causal Inference Seminar
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity