Files in this item
Minimal and random generation of permutation and matrix groups
Item metadata
dc.contributor.author | Holt, Derek | |
dc.contributor.author | Roney-Dougal, Colva Mary | |
dc.date.accessioned | 2013-06-27T09:31:01Z | |
dc.date.available | 2013-06-27T09:31:01Z | |
dc.date.issued | 2013-08-01 | |
dc.identifier | 5157201 | |
dc.identifier | acddc0fe-c53d-4ce2-a60b-afd74e9a58c0 | |
dc.identifier | 84877841197 | |
dc.identifier | 000320090300012 | |
dc.identifier.citation | Holt , D & Roney-Dougal , C M 2013 , ' Minimal and random generation of permutation and matrix groups ' , Journal of Algebra , vol. 387 , pp. 195-214 . https://doi.org/10.1016/j.jalgebra.2013.03.035 | en |
dc.identifier.issn | 0021-8693 | |
dc.identifier.other | ORCID: /0000-0002-0532-3349/work/73700916 | |
dc.identifier.uri | https://hdl.handle.net/10023/3823 | |
dc.description.abstract | We prove explicit bounds on the numbers of elements needed to generate various types of finite permutation groups and finite completely reducible matrix groups, and present examples to show that they are sharp in all cases. The bounds are linear in the degree of the permutation or matrix group in general, and logarithmic when the group is primitive. They can be combined with results of Lubotzky to produce explicit bounds on the number of random elements required to generate these groups with a specified probability. These results have important applications to computational group theory. Our proofs are inductive and largely theoretical, but we use computer calculations to establish the bounds in a number of specific small cases. | |
dc.format.extent | 20 | |
dc.format.extent | 248580 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Algebra | en |
dc.subject | Finite groups | en |
dc.subject | Generation of groups | en |
dc.subject | Matrix groups | en |
dc.subject | Permutation groups | en |
dc.subject | Probabilistic and symptotic group theory | en |
dc.subject | QA Mathematics | en |
dc.subject.lcc | QA | en |
dc.title | Minimal and random generation of permutation and matrix groups | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Mathematics and Statistics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1016/j.jalgebra.2013.03.035 | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | EP/I03582X/1 | 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.