Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorDetinko, Alla
dc.contributor.authorFlannery, Dane
dc.contributor.authorHulpke, Alexander
dc.date.accessioned2019-06-04T11:36:30Z
dc.date.available2019-06-04T11:36:30Z
dc.date.issued2018-06-04
dc.identifier.citationDetinko , 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.1466217en
dc.identifier.issn1058-6458
dc.identifier.otherPURE: 253120331
dc.identifier.otherPURE UUID: 95a74b7a-69ad-4603-b722-dc74321186b1
dc.identifier.otherScopus: 85048008698
dc.identifier.urihttp://hdl.handle.net/10023/17812
dc.descriptionOur 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.abstractWe 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.extent10
dc.language.isoeng
dc.relation.ispartofExperimental Mathematicsen
dc.rights© 2018 Taylor & Francis. This work has been made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1080/10586458.2018.1466217en
dc.subjectAlgorithmen
dc.subjectZariski denseen
dc.subjectCongruence subgroupen
dc.subjectStrong approximationen
dc.subjectQA Mathematicsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subjectT-NDASen
dc.subject.lccQAen
dc.subject.lccQA75en
dc.titleAlgorithms for experimenting with Zariski dense subgroupsen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1080/10586458.2018.1466217
dc.description.statusPeer revieweden
dc.identifier.urlhttps://arxiv.org/abs/1711.02147en


This item appears in the following Collection(s)

Show simple item record