Generating sets of finite groups

DOI10.1090/TRAN/7248MaRDI QIDQ4567904zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron, Colva M. Roney-Dougal, Andrea Lucchini

Publication date 20 June 2018

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1609.06077, http://hdl.handle.net/10023/10576

zbMATH Keywords

finite groupgenerationgenerating graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite simple groups and their classification (20D05)

Abstract: We investigate the extent to which the exchange relation holds in finite groups $G$. We define a new equivalence relation $equi{v}_{mathrmm}$, 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 $equi{v}_{mathrmm}^{(r)}$ of equivalence relations by saying that $xequi{v}_{mathrmm}^{(r)}y$ if each can be substituted for the other in any $r$-element generating set. The relations $equi{v}_{mathrmm}^{(r)}$ become finer as $r$ increases, and we define a new group invariant $psi(G)$ to be the value of $r$ at which they stabilise to $equi{v}_{mathrmm}$. Remarkably, we are able to prove that if $G$ is soluble then $psi(G)ind(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 $psi(G)=d(G)$. For insoluble $G$, we show that $d(G)leqpsi(G)leqd(G)+5$. However, we know of no examples of groups $G$ for which $psi(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 $equi{v}_{mathrmm}^{(2)}$ enables us to calculate $mathrmAut(Gamma(G))$ for all soluble groups $G$ of nonzero spread, and give detailed structural information about $mathrmAut(Gamma(G))$ in the insoluble case.

Recommendations

• scientific article; zbMATH DE number 125584
• Generating sets of the \(n\)-ary groups
• Flexibility in generating sets of finite groups
• scientific article; zbMATH DE number 1754664
• On some sets of generators of finite groups.
• scientific article; zbMATH DE number 11856
• Generating finite soluble groups
• Generating finite groups with conjugates of a subgroup
• scientific article; zbMATH DE number 7359829
• Solvable generation of finite groups

Cites work

• scientific article; zbMATH DE number 3758564 (Why is no real title available?)
• scientific article; zbMATH DE number 1154720 (Why is no real title available?)
• A theorem on random matrices and some applications
• Bias of group generators in the solvable case.
• CLASSIFYING COPOLAR SPACES AND GRAPHS
• Classes of Finite Groups
• Covering the symmetric groups with proper subgroups.
• Generation and random generation: from simple groups to maximal subgroups.
• Hamiltonian cycles in the generating graphs of finite groups.
• Invariable generation and the Chebotarev invariant of a finite group.
• Maximal independent generating sets of the symmetric group
• On Random Generation of the Symmetric Group
• On the clique number of the generating graph of a finite group
• On the generating graph of a simple group
• Probabilistic generation of finite simple groups
• Sets of elements that pairwise generate a linear group
• Simple groups admit Beauville structures.
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• Some results and questions related to the generating graph a finite group.
• The Magma algebra system. I: The user language
• The generating graph of finite soluble groups.
• The largest size of a minimal generating set of a finite group.
• The minimal generating sets of \(\mathrm{PSL}(2,p)\) of size four.
• Walks on generating sets of groups
• Zu einem von B. H. und H. Neumann gestellten Problem
• \(1\tfrac 12\)-generation of finite simple groups

Cited in

(12)

• Characterizations of groups generated by Kronecker sets
• Groups generated by derangements
• Maximal cocliques in the generating graphs of the alternating and symmetric groups
• On the semigroup rank of a group
• GENERATING MAXIMAL SUBGROUPS OF FINITE ALMOST SIMPLE GROUPS
• An algorithm for finding minimal generating sets of finite groups
• Some results and questions related to the generating graph a finite group.
• Generating groups by conjugation-invariant sets.
• A note on maximal subgroups and conjugacy classes of finite groups
• Graphs defined on groups
• Characterising bimodal collections of sets in finite groups
• The independence graph of a finite group

Describes a project that uses

Uses Software

• OEIS
• Magma

This page was built for publication: Generating sets of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567904)