On the generating graph of direct powers of a simple group.

DOI10.1007/S10801-012-0405-XMaRDI QIDQ364705zbMATH OpenOpenAlexFDO

Authors Timothy C. Burness, Eleonora Crestani

Publication date 9 September 2013

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10801-012-0405-x

zbMATH Keywords

2-generator groupsdiameters of graphsdirect powers of simple groupsfinite simple groupsgenerating graphsspreads

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite simple groups and their classification (20D05) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Generators, relations, and presentations of groups (20F05)

Review text

Let \(S\) be a nonabelian finite simple group and let \(n\) be an integer such that the direct product \(S^n\) is 2-generated. Let \(\Gamma(S^n)\) be the generating graph of \(S^n\) and let \(\Gamma_n(S)\) be the graph obtained from \(\Gamma(S^n)\) by removing all isolated vertices. A recent result by one of the authors and the reviewer [J. Algebr. Comb. 37, No. 2, 249-263 (2013; Zbl 1276.20026)] states that \(\Gamma_n(S)\) is connected. In this paper the authors investigate the diameter of this graph. A deep theorem of \textit{T. Breuer, R. M. Guralnick} and \textit{W. M. Kantor} [J. Algebra 320, No. 2, 443-494 (2008; Zbl 1181.20013)] implies that \(\text{diam\,}\Gamma_1(S)=2\); the authors define \(\Delta(S)\) to be the maximal \(n\) such that \(\text{diam\,}\Gamma_n(S)=2\). They prove that \(\Delta(S)=2\) for all \(S\), which is best possible since \(\Delta(A_5)=2\), and they show that \(\Delta(S)\) tends to infinity as \(|S|\) tends to infinity. Explicit upper and lower bounds are established for direct powers of alternating groups. It appears to be much more difficult to obtain explicit bounds when \(S\) is a simple group of Lie type, however the following lower bound is given: there exists an absolute constant \(c\) such that if \(S\) has Lie rank \(r\) over the field with \(q=p^f\) elements, then either \(S=\text{Sp}(2r,2)\) or \(\Delta(S)\geq cf^{-1}q^r\).

Recommendations

• The diameter of the non-nilpotent graph of a finite group
• On the connectivity of proper power graphs of finite groups
• The diameter of proper power graphs of alternating groups
• On the diameter of a Cayley graph of a simple group of Lie type based on a conjugacy class
• On the diameter of Cayley graphs of the symmetric group
• Diameter of a direct power of a finite group
• A diameter bound for finite simple groups of large rank
• On the clique number of the generating graph of a finite group
• Note on the power graph of finite simple groups.
• The diameter of the commuting graph of a finite group with trivial centre.

Cites work

• Caractères unipotents de \({}^ 3D_ 4({\mathbb{F}}_ q)\)
• Character Table and Blocks of Finite Simple Triality Groups 3 D 4 (q)
• Fixed point ratios in actions of finite classical groups. II.
• Generators for Simple Groups
• Hamiltonian cycles in the generating graphs of finite groups.
• scientific article; zbMATH DE number 3906699 (Why is no real title available?)
• scientific article; zbMATH DE number 3479126 (Why is no real title available?)
• scientific article; zbMATH DE number 3479127 (Why is no real title available?)
• scientific article; zbMATH DE number 3439117 (Why is no real title available?)
• scientific article; zbMATH DE number 3382642 (Why is no real title available?)
• On a class of doubly transitive groups
• On Ree's Series of Simple Groups
• On the clique number of the generating graph of a finite group
• Probabilistic generation of finite simple groups
• Probabilistic generation of finite simple groups. II.
• Sets of elements that pairwise generate a linear group
• Sets of permutations that generate the symmetric group pairwise.
• Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky
• The conjugate classes of Chevalley groups of type \((G_2)\)
• THE EULERIAN FUNCTIONS OF A GROUP
• The Magma algebra system. I: The user language
• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• The probability of generating a finite classical group
• The probability of generating a finite simple group
• The probability of generating the symmetric group
• The semisimple conjugacy classes and the generic class number of the finite simple groups of lie type E₈
• The semisimple conjugacy classes of finite groups of lie type E₆and E₇
• Two-generator groups. I
• Unipotent and nilpotent classes in simple algebraic groups and Lie algebras.

Cited in

(4)

• The non-isolated vertices in the generating graph of a direct powers of simple groups.
• The independence graph of a finite group
• Diameter of a direct power of a finite group
• Co-maximal graphs of two generator groups

Describes a project that uses

Uses Software

• Magma

This page was built for publication: On the generating graph of direct powers of a simple group.

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