Practical Computation with Linear Groups Over Infinite Domains
Authors:
- A. S. DetinkoADA. S. Detinko
- D. L. FlanneryDFD. L. Flannery
- 11 April 2019
- book chapter
- Published by Cambridge University Press (CUP)
- p. 261-270
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.Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Algorithms for linear groups of finite rankJournal of Algebra, 2013
- Random subgroups of linear groups are freeDuke Mathematical Journal, 2011
- Algorithms for the Tits alternative and related problemsJournal of Algebra, 2011
- Conditions for linear groups to have unipotent derived subgroupsJournal of Algebra, 2010
- Algorithms for computing with nilpotent matrix groups over infinite domainsJournal of Symbolic Computation, 2008
- Testing polycyclicity of finitely generated rational matrix groupsMathematics of Computation, 2007
- Computing polycyclic presentations for polycyclic rational matrix groupsJournal of Symbolic Computation, 2005
- Quantum automata and algebraic groupsJournal of Symbolic Computation, 2005
- Some General Algorithms. I: Arithmetic GroupsAnnals of Mathematics, 1980
- Almost all subgroups of a Lie group are freeJournal of Algebra, 1971