The number of composition factors of order p in completely reducible groups of characteristic p

Michael Giudici, S. P. Glasby, Cai Heng Li, Gabriel Verret

    Research output: Contribution to journalArticle

    2 Citations (Scopus)


    Let q be a power of a prime p and let G be a completely reducible subgroup of GL(d,q). We prove that the number of composition factors of G that have prime order p is at most (εqd−1)/(p−1), where εq is a function of q satisfying 1⩽εq⩽3/2. For every q, we give examples showing this bound is sharp infinitely often.

    Original languageEnglish
    Pages (from-to)241-255
    Number of pages15
    JournalJournal of Algebra
    Publication statusPublished - 15 Nov 2017


    Cite this