| COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
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 applicationsAdd 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. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsThe COVID-19 pandemic: Impact on thinking and practice in some key sectors going forward The Believing Brain: Neuroscience of Belief panel discussion Cambridge Endangered Languages and Cultures GroupOther talksKirk Public Lecture: Topological Quantum Field Theory: From Physics to Mathematics and back Morning Coffee Using Machine Learning to Deduce Molecular Weight Distribution from Rheology LMB Seminar - The structures and mechanisms that maintain ciliary proteostasis - In person only Rheoinformatics: A Data-driven Platform for Unifying Experimental, Theoretical, and Computational Rheology Welcome and Introduction |