Practical computation with linear groups over infinite domains

Detinko, A. S.; Flannery, D. L.

Abstract

We survey recent progress in computing with finitely generated linear groups over infinite fields, describing the mathematical background of a methodology applied to design practical algorithms for these groups. Implementations of the algorithms have been used to perform extensive computer experiments.

Citation

Detinko, A. S., & Flannery, D. L. (2019). Practical computation with linear groups over infinite domains. In C. Campbell, C. Parker, M. Quick, E. Robertson, & C. Roney-Dougal (Eds.), Groups St Andrews 2017 in Birmingham (261-270). Cambridge: Cambridge University Press. https://doi.org/10.1017/9781108692397.011

• Acceptance Date: Nov 1, 2018
• Publication Date: Apr 11, 2019
• Deposit Date: May 16, 2019
• Journal: Groups St Andrews 2017 in Birmingham
• Publisher: Cambridge University Press
• Pages: 261-270
• Series Title: London Mathematical Society Lecture Note Series
• Series Number: 455
• Book Title: Groups St Andrews 2017 in Birmingham
• ISBN: 9781108692397; 9781108728744
• DOI: https://doi.org/10.1017/9781108692397.011
• Public URL: https://hull-repository.worktribe.com/output/1794355
• Publisher URL: https://www.cambridge.org/core/books/groups-st-andrews-2017-in-birmingham/practical-computation-with-linear-groups-over-infinite-domains/FA957C3E12A039D7E23ECB31530DA173