Sets of elements that pairwise generate a linear group (Q2426424)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sets of elements that pairwise generate a linear group
scientific article

    Statements

    Sets of elements that pairwise generate a linear group (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 April 2008
    0 references
    Let \(G\) be a finite group that can generated by two elements, \(\Gamma=\Gamma(G)\) be a graph on the set of elements of \(G\) and two vertices are adjacent if they generate \(G\). Let \(\mu(G)\) be the maximal size of a clique of \(\Gamma\), \(\sigma(G)\) be the least integer \(k\) such that \(G\) is the union of \(k\) of its proper subgroups and \(\chi(G)\) be the chromatic number of \(\Gamma\). We have \(\mu(G)\leq \chi(G)\leq \sigma(G)\). Corollary. Let \(G\) be any of the groups \((P)GL(n,q)\), \((P)SL(n,q)\), and let \(\Gamma=\Gamma(G)\) be as above. If \(n\geq 12\) and either \(n\not\equiv 2\;(\text{ mod}\;4)\) or \(n\equiv 2\;(\text{ mod}\;4)\) and \(G=(P)SL(n,q)\), then \(\mu(G)=\chi(G)=\sigma(G)\).
    0 references
    general linear group
    0 references
    covering
    0 references
    pairwise generating set
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers