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

DOI10.1112/JLMS.12138MaRDI QIDQ4646246zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Cheryl E. Praeger, Kyle Rosa, Gabriel Verret, S. 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

completely reducible groupprimitive permutation groupquasiprimitivesemiprimitive

Mathematics Subject Classification ID

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

Abstract: We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds on the composition length of a finite completely reducible linear group in terms of some of its parameters. In almost all cases we show that the bounds are sharp, and describe the extremal examples.

Recommendations

• TRANSITIVE PERMUTATION GROUPS AND IRREDUCIBLE LINEAR GROUPS
• On the orders of primitive groups
• On the composition length of finite primitive linear groups
• Asymptotic results for primitive permutation groups and irreducible linear groups.
• scientific article; zbMATH DE number 4148415

Cited in

(13)

• How many elements are needed to generate a finite group with good probability?
• On the composition length of finite primitive linear groups
• Comparing the order and the minimal number of generators of a finite irreducible linear group
• The number of composition factors of order \(p\) in completely reducible groups of characteristic \(p\)
• scientific article; zbMATH DE number 4148415 (Why is no real title available?)
• TRANSITIVE PERMUTATION GROUPS AND IRREDUCIBLE LINEAR GROUPS
• Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
• Bounding the even abelian composition factors in finite linear groups
• 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
• Minimal sized generating sets of permutation groups
• On the reconstruction index of permutation groups: general bounds

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646246)