Files in this item
Algorithms for experimenting with Zariski dense subgroups
Item metadata
dc.contributor.author | Detinko, Alla | |
dc.contributor.author | Flannery, Dane | |
dc.contributor.author | Hulpke, Alexander | |
dc.date.accessioned | 2019-06-04T11:36:30Z | |
dc.date.available | 2019-06-04T11:36:30Z | |
dc.date.issued | 2018-06-04 | |
dc.identifier | 253120331 | |
dc.identifier | 95a74b7a-69ad-4603-b722-dc74321186b1 | |
dc.identifier | 85048008698 | |
dc.identifier | 000560218500005 | |
dc.identifier.citation | Detinko , A , Flannery , D & Hulpke , A 2018 , ' Algorithms for experimenting with Zariski dense subgroups ' , Experimental Mathematics , vol. Latest Articles . https://doi.org/10.1080/10586458.2018.1466217 | en |
dc.identifier.issn | 1058-6458 | |
dc.identifier.uri | https://hdl.handle.net/10023/17812 | |
dc.description | Our work was supported by a Marie Skłodowska-Curie Individual Fellowship grant under Horizon 2020 (EU Framework Programme for Research and Innovation), and Simons Foundation Collaboration Grant 244502. | en |
dc.description.abstract | We give a method to describe all congruence images of a finitely generated Zariski dense group H ≤ SL (n,ℤ). The method is applied to obtain efficient algorithms for solving this problem in odd prime degree n;if n=2 then we compute all congruence images only modulo primes. We propose a separate method that works for all n as long as H contains a known transvection. The algorithms have been implemented in GAP, enabling computer experiments with important classes of linear groups that have recently emerged. | |
dc.format.extent | 10 | |
dc.format.extent | 218626 | |
dc.language.iso | eng | |
dc.relation.ispartof | Experimental Mathematics | en |
dc.subject | Algorithm | en |
dc.subject | Zariski dense | en |
dc.subject | Congruence subgroup | en |
dc.subject | Strong approximation | en |
dc.subject | QA Mathematics | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.subject.lcc | QA75 | en |
dc.title | Algorithms for experimenting with Zariski dense subgroups | en |
dc.type | Journal article | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.doi | 10.1080/10586458.2018.1466217 | |
dc.description.status | Peer reviewed | en |
dc.identifier.url | https://arxiv.org/abs/1711.02147 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.