Primitive permutation groups and their section-regular partitions.
type: Item
instance of: scholarly article
title: Primitive permutation groups and their section-regular partitions.
zbMATH Open document ID: 1178.20001
author: Peter M. Neumann
published in: Michigan Mathematical Journal
publication date: 2009-06-17T00:00:00Z
review text: Let \(G\leqslant\text{Sym}(X)\) and \(\rho\) be a partition of \(X\). A `section' of \(\rho\) is a subset of \(X\) containing one representative for each class of the partition. The partition \(\rho\) is called `section-regular' if there exists a section \(S\) of \(\rho\) such that \(S^g\) is also a section of \(\rho\) for all \(g\in G\). A nontrivial group \(G\leqslant\text{Sym}(X)\) is called `synchronizing' if there are no nontrivial proper section-regular partitions of \(X\). This concept has links with the theory of semigroups and automata, this is sketched in the last section of the paper. It can easily be seen that every synchronizing group is primitive. J. Araújo asked if the converse was true. The author answers by the negative and begins to investigate synchronizing groups, giving some general analysis and examples. Some results are: -- If \(G\) is transitive, every section-regular partition has all its classes of the same size. -- If \(G\) is primitive and \(\rho\) is a nontrivial proper section-regular partition of \(X\), then the number of classes and the size of classes are at least 3. -- If \(G\) is primitive but has an index 2 subgroup that is imprimitive, then \(G\) is not synchronizing. Examples of primitive non-synchronizing groups are given for several of the O'Nan-Scott types. However the number of possible degrees for such groups has density 0, and a precise big O formula for the number of possible degrees lower than a fixed \(x\) is determined. Some future possible research directions are outlined (to be undertaken by whoever wants to).
reviewed by: Alice Devillers
Mathematics Subject Classification ID: 20B15
Mathematics Subject Classification ID: 20B05
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68Q70
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5566085
zbMATH Keywords: finite permutation groups
zbMATH Keywords: synchronizing groups
zbMATH Keywords: automata
zbMATH Keywords: primitive groups
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1307/mmj/1242071695
OpenAlex ID: W1965325185
cites work: Synchronizing groups and automata
cites work: Q4063504
cites work: Q4100097
cites work: Q4231664
cites work: CORES OF SYMMETRIC GRAPHS
cites work: On the degrees of primitive permutation groups
cites work: Q4882944
cites work: On Representatives of Subsets
cites work: Intersection matrices for finite permutation groups
cites work: On factorizations of almost simple groups
cites work: The Finite Primitive Permutation Groups of Rank Three
cites work: Q4161482
cites work: Q4159516
cites work: Q5422244
cites work: Q3032498
cites work: Primitive Permutationsgruppen vom Grad \(2p\)
DOI: 10.1307/MMJ/1242071695
description: scientific article; zbMATH DE number 5566085