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

  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

Algorithms for Zariski dense subgroups and their applications

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

McCrum Lecture Theatre, Bene't Street ( behind the Eagle Pub ) Queen's Building, Emmanuel College, 4 pm (refreshments from 3.15 pm) followed by dinner in Pembroke College at 8 pm 2013 UK~IRC Innovation Summit

Other talks

title and abstract tba Coming soon Trigger-Level Analysis at ATLAS Title to be confirmed Evolutionary constraints shape the evolution of mammalian tooth classes Nature and law
 

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