Talks.cam will close on 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Algorithms for Zariski dense subgroups and their applications

Algorithms for Zariski dense subgroups and their applications

Add to your list(s) Download to your calendar using vCal

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

OGGW02 - Actions on graphs and metric spaces

This talk deals with algorithms for linear groups over infinite fields. A principal motivation of this research is applications of linear groups in many areas of mathematics including geometry. Exploiting Zariski density and the strong approximation property, we have developed new methods for practical computation with finitely generated linear groups. In the talk we present algorithms to investigate properties and structure of linear groups based on these methods. We then demonstrate how the algorithms have been applied in the solution of problems via computer-aided experimentation. Joint work with Dane Flannery and Alexander Hulpke.

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

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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