{"paper":{"title":"The number of composition factors of order $p$ in completely reducible groups of characteristic $p$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Cai Heng Li, Gabriel Verret, Michael Giudici, S. P. Glasby","submitted_at":"2016-02-25T07:35:56Z","abstract_excerpt":"Let $q$ be a power of a prime $p$ and let $G$ be a completely reducible subgroup of $\\mathrm{GL}(d,q)$. We prove that the number of composition factors of $G$ that have prime order $p$ is at most $(\\varepsilon_q d-1)/(p-1)$, where $\\varepsilon_q$ is a function of $q$ satisfying $1\\leqslant\\varepsilon_q\\leqslant 3/2$. For every $q$, we give examples showing this bound is sharp infinitely often."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07829","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}