On the generating graph of direct powers of a simple group. (Q364705)

From MaRDI portal
Revision as of 11:22, 28 June 2023 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
On the generating graph of direct powers of a simple group.
scientific article

    Statements

    On the generating graph of direct powers of a simple group. (English)
    0 references
    0 references
    0 references
    9 September 2013
    0 references
    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\).
    0 references
    finite simple groups
    0 references
    generating graphs
    0 references
    2-generator groups
    0 references
    direct powers of simple groups
    0 references
    diameters of graphs
    0 references
    spreads
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references