Diameters of graphs related to groups and base sizes of primitive groups
View/ Open
Date
29/11/2022Author
Funder
Grant ID
EP/R014604/1
Keywords
Metadata
Show full item recordAltmetrics Handle Statistics
Altmetrics DOI Statistics
Abstract
In this thesis, we study three problems. First, we determine new bounds for base sizes b(G,Ω) of primitive subspace actions of finite almost simple classical groups G. Such base sizes are useful statistics in computational group theory. We show that if the underlying set Ω consists of k-dimensional subspaces of the natural module V = F_q^n for G, then b(G,Ω) ≥ ⌈n/k⌉ + c, where c ∈ {-2,-1,0,1} depends on n, q, k and the type of G. If instead Ω consists of pairs {X,Y} of subspaces of V with k:=dim(X) < dim(Y), and G is generated by PGL(n,q) and the graph automorphism of PSL(n,q), then b(G,Ω) ≤ max{⌈n/k⌉,4}.
The second part of the thesis concerns the intersection graph Δ_G of a finite simple group G. This graph has vertices the nontrivial proper subgroups of G, and its edges are the pairs of subgroups that intersect nontrivially. We prove that Δ_G has diameter at most 5, and that a diameter of 5 is achieved only by the graphs of the baby monster group and certain unitary groups of odd prime dimension. This answers a question posed by Shen.
Finally, we study the non-commuting, non-generating graph Ξ(G) of a group G, where G/Z(G) is either finite or non-simple. This graph is closely related to the hierarchy of graphs introduced by Cameron. The graph's vertices are the non-central elements of G, and its edges are the pairs {x,y} such that ⟨x, y⟩ ≠ G and xy ≠ yx. We show that if Ξ(G) has an edge, then either the graph is connected with diameter at most 5; the graph has exactly two connected components, each of diameter 2; or the graph consists of isolated vertices and a component of diameter at most 4. In this last case, either the nontrivial component has diameter 2, or G/Z(G) is a non-simple insoluble primitive group with every proper quotient cyclic.
Type
Thesis, PhD Doctor of Philosophy
Collections
Except where otherwise noted within the work, this item's licence for re-use is described as Creative Commons Attribution 4.0 International
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) - ThesisPart 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 articleTo 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) - ThesisComputational 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 ...