St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  •   St Andrews Research Repository
  • University of St Andrews Research
  • University of St Andrews Research
  • University of St Andrews Research
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Minimal and random generation of permutation and matrix groups

Thumbnail
View/Open
lingensd_revised.pdf (242.7Kb)
Date
01/08/2013
Author
Holt, Derek
Roney-Dougal, Colva Mary
Keywords
Finite groups
Generation of groups
Matrix groups
Permutation groups
Probabilistic and symptotic group theory
QA Mathematics
Metadata
Show full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
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.
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
Publication
Journal of Algebra
Status
Peer reviewed
DOI
https://doi.org/10.1016/j.jalgebra.2013.03.035
ISSN
0021-8693
Type
Journal article
Rights
© 2013 Elsevier Inc. This is the author’s version of a work that was accepted for publication in the Journal of Algebra. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of Algebra, Vol 387, 2013. DOI: http://dx.doi.org/10.1016/j.jalgebra.2013.03.035
Collections
  • University of St Andrews Research
URI
http://hdl.handle.net/10023/3823

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Related items

Showing items related by title, author, creator and subject.

  • Topics in computational group theory : primitive permutation groups and matrix group normalisers 

    Coutts, Hannah Jane (University of St Andrews, 2011-11) - Thesis
    Part I of this thesis presents methods for finding the primitive permutation groups of degree d, where 2500 ≤ d < 4096, using the O'Nan-Scott Theorem and Aschbacher's theorem. Tables of the groups G are given for each ...
  • What is a group? Young children's perceptions of different types of groups and group entitativity 

    Plötner, Maria; Over, Harriet; Carpenter, Malinda; Tomasello, Michael (2016-03-24) - Journal article
    To date, developmental research on groups has focused mainly on in-group biases and intergroup relations. However, little is known about children’s general understanding of social groups and their perceptions of different ...
  • The construction of finite soluble factor groups of finitely presented groups and its application 

    Wegner, Alexander (University of St Andrews, 1992) - Thesis
    Computational group theory deals with the design, analysis and computer implementation of algorithms for solving computational problems involving groups, and with the applications of the programs produced to interesting ...
Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter