Bounding the composition length of primitive permutation groups and completely reducible linear groups

DOI10.1112/jlms.12138zbMath1446.20008arXiv1712.05520OpenAlexW2964068777WikidataQ60325118 ScholiaQ60325118MaRDI QIDQ4646246

Kyle Rosa, Gabriel Verret, Cheryl E. Praeger, Stephen P. Glasby

Publication date: 11 January 2019

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.05520

zbMATH Keywords

primitive permutation groupquasiprimitivecompletely reducible groupsemiprimitive

Mathematics Subject Classification ID

Primitive groups (20B15) General theory for finite permutation groups (20B05) Other matrix groups over finite fields (20H30)

Related Items (5)

Comparing the order and the minimal number of generators of a finite irreducible linear group ⋮ On the orders of composition factors in completely reducible groups ⋮ The minimum generating set problem ⋮ A subexponential bound on the cardinality of abelian quotients in finite transitive groups ⋮ Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree

This page was built for publication: Bounding the composition length of primitive permutation groups and completely reducible linear groups