Skip to content

Research at St Andrews

Generating sets of finite groups

Research output: Research - peer-reviewArticle

DOI

Open Access permissions

Open

Abstract

We investigate the extent to which the exchange relation holds in finite groups G. We define a new equivalence relation ≡m, where two elements are equivalent if each can be substituted for the other in any generating set for G. We then refine this to a new sequence ≡(r)/m of equivalence relations by saying that x≡(r)/m y if each can be substituted for the other in any r-element generating set. The relations ≡(r)/m become finer as r increases, and we define a new group invariant ψ(G) to be the value of r at which they stabilise to ≡m. Remarkably, we are able to prove that if G is soluble then ψ(G) ∈ {d(G),d(G)+1}, where d(G) is the minimum number of generators of G, and to classify the finite soluble groups G for which ψ(G)=d(G). For insoluble G, we show that d(G) ≤ ψ(G) ≤ d(G)+5. However, we know of no examples of groups G for which ψ(G) > d(G)+1. As an application, we look at the generating graph of G, whose vertices are the elements of G, the edges being the 2-element generating sets. Our relation ≡(2)m enables us to calculate Aut(Γ(G)) for all soluble groups G of nonzero spread, and give detailed structural information about Aut(Γ(G)) in the insoluble case.
Close

Details

Original languageEnglish
JournalTransactions of the American Mathematical Society
DOIs
StateAccepted/In press - 2 Apr 2017

    Research areas

  • Finite group, Generation, Generating graph

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. The power graph of a torsion-free group

    Cameron, P. J., Guerra, H. & Jurina, Š. 19 Feb 2018 (Accepted/In press) In : Journal of Algebraic Combinatorics.

    Research output: Research - peer-reviewArticle

  2. Sesqui-arrays, a generalisation of triple arrays

    Bailey, R. A., Cameron, P. J. & Nilson, T. 13 Feb 2018 (Accepted/In press) In : Australasian Journal of Combinatorics.

    Research output: Research - peer-reviewArticle

  3. Synchronization and separation in the Johnson schemes

    Aljohani, M., Bamberg, J. & Cameron, P. J. 9 Feb 2018 In : Portugaliae Mathematica. 74, 3, p. 213-232

    Research output: Research - peer-reviewArticle

  4. The cycle polynomial of a permutation group

    Cameron, P. J. & Semeraro, J. 25 Jan 2018 In : Electronic Journal of Combinatorics. 25, 1, 13 p., P1.14

    Research output: Research - peer-reviewArticle

  5. Triple arrays from difference sets

    Nilson, T. & Cameron, P. J. Nov 2017 In : Journal of Combinatorial Designs. 25, 11, p. 494-506 13 p.

    Research output: Research - peer-reviewArticle

Related by journal

  1. Orbits of primitive k-homogenous groups on (n-k)-partitions with applications to semigroups

    Araújo, J., Bentz, W. & Cameron, P. J. 9 May 2017 (Accepted/In press) In : Transactions of the American Mathematical Society.

    Research output: Research - peer-reviewArticle

  2. Some undecidability results for asynchronous transducers and the Brin-Thompson group 2V

    Belk, J. & Bleak, C. May 2017 In : Transactions of the American Mathematical Society. 369, 5, p. 3157-3172 16 p.

    Research output: Research - peer-reviewArticle

  3. On the Lq -spectrum of planar self-affine measures

    Fraser, J. M. 2016 In : Transactions of the American Mathematical Society. 368, 8, p. 5579-5620 42 p.

    Research output: Research - peer-reviewArticle

ID: 249556105