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

DOI10.1112/JLMS.12138zbMATH Open1446.20008DBLPjournals/jlms/GlasbyPRV18arXiv1712.05520OpenAlexW2964068777WikidataQ60325118 ScholiaQ60325118MaRDI QIDQ4646246FDOQ4646246

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)

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.

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

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.
• Publication:3478615

zbMATH Keywords

primitive permutation groupquasiprimitivecompletely reducible groupsemiprimitive

Mathematics Subject Classification ID

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

Cited In (11)

• On the composition length of finite primitive linear groups
• Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
• The minimum generating set problem
• How many elements are needed to generate a finite group with good probability?
• 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\)
• Title not available (Why is that?)
• Bounding the even abelian composition factors in finite linear groups
• A subexponential bound on the cardinality of abelian quotients in finite transitive groups
• On the orders of composition factors in completely reducible 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)