Skip to main content Accessibility help
×
Hostname: page-component-788cddb947-55tpx Total loading time: 0 Render date: 2024-10-07T23:43:23.342Z Has data issue: false hasContentIssue false

Practical Computation with Linear Groups Over Infinite Domains

Published online by Cambridge University Press:  15 April 2019

C. M. Campbell
Affiliation:
University of St Andrews, Scotland
C. W. Parker
Affiliation:
University of Birmingham
M. R. Quick
Affiliation:
University of St Andrews, Scotland
E. F. Robertson
Affiliation:
University of St Andrews, Scotland
C. M. Roney-Dougal
Affiliation:
University of St Andrews, Scotland
Get access

Summary

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.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2019

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aoun, R., Random subgroups of linear groups are free, Duke Math. J. (1) 160 (2011), 117–173.Google Scholar
Assmann, B. and Eick, B., Computing polycyclic presentations for polycyclic rational matrix groups, J. Symbolic Comput. (6) 40 (2005), 1269–1284.Google Scholar
Assmann, B. and Eick, B., Testing polycyclicity of finitely generated rational matrix groups, Math. Comp. 76 (2007), 1669–1682.CrossRefGoogle Scholar
Bäärnhielm, H., Holt, D., Leedham-Green, C. R., and O’Brien, E. A., A practical model for computation with matrix groups, J. Symbolic Comput. 68 (2015), 27–60.CrossRefGoogle Scholar
Bosma, W., Cannon, J., and Playoust, C., The Magma algebra system. I. The user language, J. Symbolic Comput. (3-4) 24 (1997), 235–265.Google Scholar
Chen, Y., Yang, Y., and Yui, N., Monodromy of Calabi-Yau differential equations (with an appendix by Cord Erdenberger), J. Reine Angew. Math. 616 (2008), 167–203.Google Scholar
Coulangeon, R., Nebe, G., Braun, O., and Schönnenbeck, S., Computing in arithmetic groups with Voronoi’s algorithm, J. Algebra (1) 435 (2015), 263–285.Google Scholar
de Graaf, W. A., Computation with linear algebraic groups (Chapman & Hall/CRC, 2017).CrossRefGoogle Scholar
Derksen, H., Jeandel, E., and Koiran, P., Quantum automata and algebraic groups, J. Symbolic Comput. (3-4) 39 (2005), 357–371.Google Scholar
Detinko, A. S. and Flannery, D. L., Algorithms for computing with nilpotent matrix groups over infinite domains, J. Symbolic Comput. (1) 43 (2008), 8–26.Google Scholar
Detinko, A. S., Flannery, D. L., and de Graaf, W. A., Integrality and arithmeticity of solvable linear groups, J. Symbolic Comput. 68 (2015), 138–145.CrossRefGoogle Scholar
Detinko, A. S., Flannery, D. L., and Hulpke, A., Algorithms for arithmetic groups with the congruence subgroup property, J. Algebra 421 (2015), 234–259.CrossRefGoogle Scholar
Detinko, A. S., Flannery, D. L., and Hulpke, A., Zariski density and computing in arithmetic groups, Math. Comp. 87 (2018), 967–986.Google Scholar
Detinko, A. S., Flannery, D. L., and Hulpke, A., GAP functionality for Zariski dense groups, Oberwolfach Preprints, OWP 2017-22.Google Scholar
Detinko, A. S., Flannery, D. L., and Hulpke, A., Algorithms for experimenting with Zariski dense subgroups, Exp. Math., to appear.Google Scholar
Detinko, A. S., Flannery, D. L., and Hulpke, A., The strong approximation theorem and computing with linear groups, preprint (2018).CrossRefGoogle Scholar
Detinko, A. S., Flannery, D. L., and O’Brien, E. A., Algorithms for the Tits alternative and related problems, J. Algebra 344 (2011), 397–406.CrossRefGoogle Scholar
Detinko, A. S., Flannery, D. L., and O’Brien, E. A., Algorithms for linear groups of finite rank, J. Algebra 393 (2013), 187–196.CrossRefGoogle Scholar
Detinko, A. S., Flannery, D. L., and O’Brien, E. A., Recognizing finite matrix groups over infinite fields, J. Symbolic Comput. 50 (2013), 100–109.CrossRefGoogle Scholar
Dixon, J., The structure of linear groups (Van Nostrand Reinhold, London 1971).Google Scholar
Epstein, D. B. A., Almost all subgroups of a Lie group are free, J. Algebra 19 (1971), 261–262.CrossRefGoogle Scholar
The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.8.7; 2017, http://www.gap-system.orgGoogle Scholar
Grunewald, F. and Segal, D., Some general algorithms. I. Arithmetic groups, Ann. of Math. (3) 112 (1980), 531–583.Google Scholar
Lennox, J. C. and Robinson, D. J. S., The theory of infinite soluble groups (OUP, Oxford 2004).CrossRefGoogle Scholar
Long, D. D. and Reid, A. W., Small subgroups of SL(3, Z), Exp. Math. (4) 20 (2011), 412–425.Google Scholar
Lubotzky, A. and Segal, D., Subgroup growth, Progress in Mathematics, Vol. 212, (Birkhäuser, Basel 2003).CrossRefGoogle Scholar
Meiri, C., Generating pairs for finite index subgroups of SL(n, Z), J. Algebra 470 (2017), 420–424.CrossRefGoogle Scholar
O’Brien, E. A., Algorithms for matrix groups, in Groups St Andrews 2009 in Bath. Vol. 2, (Campbell, C. M. et al., eds.), London Math. Soc. Lecture Note Ser. 388 (CUP, Cambridge 2011), 297–323.Google Scholar
Rivin, I., Large Galois groups with applications to Zariski density, http://arxiv.org/abs/1312.3009v4Google Scholar
Sarnak, P., Notes on thin matrix groups, in Thin groups and superstrong approximation, Math. Sci. Res. Inst. Publ. 61, (CUP, Cambridge 2014), 343–362.Google Scholar
Singh, S., Arithmeticity of four hypergeometric monodromy groups associated to Calabi-Yau threefolds, Int. Math. Res. Notices (18), 2015 (2015), 8874–8889.Google Scholar
Singh, S. and Venkataramana, T., Arithmeticity of certain symplectic hypergeometric groups, Duke Math. J. (3) 163 (2014), 591–617.Google Scholar
Suprunenko, D. A., Matrix groups, Translations of Mathematical Monographs, Vol. 45 (AMS, Providence 1976).CrossRefGoogle Scholar
Tits, J., Free subgroups in linear groups, J. Algebra 20 (1972), 250–270.CrossRefGoogle Scholar
Wehrfritz, B. A. F., Infinite linear groups (Springer-Verlag, New York 1973).CrossRefGoogle Scholar
Wehrfritz, B. A. F., Conditions for linear groups to have unipotent derived subgroups, J. Algebra 323 (2010), 3147–3154.CrossRefGoogle Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×