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.

The Hall–Paige conjecture, and synchronization for affine and diagonal groups

Thumbnail
View/Open
Bray_2019_Hall_Paige_conjecture_JAlgebra_AAM.pdf (264.5Kb)
Date
03/2020
Author
Bray, John
Cai, Qi
Cameron, Peter Jephson
Spiga, Pablo
Zhang, Hua
Keywords
Automata
Complete mappings
Graphs
Hall-Paige conjecture
Orbitals
Primitive groups
Separating groups
Synchronizing groups
Transformation groups
QA Mathematics
Mathematics(all)
T-NDAS
BDC
Metadata
Show full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
Abstract
The Hall-Paige conjecture asserts that a finite group has a complete mapping if and only if its Sylow subgroups are not cyclic. The conjecture is now proved, and one aim of this paper is to document the final step in the proof (for the sporadic simple group J4). We apply this result to prove that primitive permutation groups of simple diagonal type with three or more simple factors in the socle are non-synchronizing. We also give the simpler proof that, for groups of affine type, or simple diagonal type with two socle factors, synchronization and separation are equivalent. Synchronization and separation are conditions on permutation groups which are stronger than primitivity but weaker than 2-homogeneity, the second of these being stronger than the first. Empirically it has been found that groups which are synchronizing but not separating are rather rare. It follows from our results that such groups must be primitive of almost simple type.
Citation
Bray , J , Cai , Q , Cameron , P J , Spiga , P & Zhang , H 2020 , ' The Hall–Paige conjecture, and synchronization for affine and diagonal groups ' , Journal of Algebra , vol. 545 , pp. 27-42 . https://doi.org/10.1016/j.jalgebra.2019.02.025
Publication
Journal of Algebra
Status
Peer reviewed
DOI
https://doi.org/10.1016/j.jalgebra.2019.02.025
ISSN
0021-8693
Type
Journal article
Rights
© 2019, Elsevier, Inc. 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 as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1016/j.jalgebra.2019.02.025
Collections
  • University of St Andrews Research
URI
http://hdl.handle.net/10023/19613

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