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

doi:10.1016/j.jalgebra.2017.07.009

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 journal › Article › peer-review

3 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	241-255
Number of pages	15
Journal	Journal of Algebra
Volume	490
DOIs	https://doi.org/10.1016/j.jalgebra.2017.07.009
Publication status	Published - 15 Nov 2017

Access to Document

10.1016/j.jalgebra.2017.07.009

https://arxiv.org/abs/1602.07829Licence: CC BY-NC-ND

Cite this

@article{095417d47a234f38ab56ede5141bf069,

title = "The number of composition factors of order p in completely reducible groups of characteristic p",

abstract = "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.",

keywords = "Completely reducible, Composition factors",

author = "Michael Giudici and Glasby, {S. P.} and Li, {Cai Heng} and Gabriel Verret",

year = "2017",

month = nov,

day = "15",

doi = "10.1016/j.jalgebra.2017.07.009",

language = "English",

volume = "490",

pages = "241--255",

journal = "Journal of Algebra",

issn = "0021-8693",

publisher = "Academic Press",

}

TY - JOUR

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

AU - Giudici, Michael

AU - Glasby, S. P.

AU - Li, Cai Heng

AU - Verret, Gabriel

PY - 2017/11/15

Y1 - 2017/11/15

N2 - 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.

AB - 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.

KW - Completely reducible

KW - Composition factors

UR - http://www.scopus.com/inward/record.url?scp=85026455426&partnerID=8YFLogxK

U2 - 10.1016/j.jalgebra.2017.07.009

DO - 10.1016/j.jalgebra.2017.07.009

M3 - Article

AN - SCOPUS:85026455426

VL - 490

SP - 241

EP - 255

JO - Journal of Algebra

JF - Journal of Algebra

SN - 0021-8693

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this