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

2017/12/15 by Glasby, S. P., Praeger, Cheryl E., Rosa, Kyle +1
#20B05 #20B15 #20H30 #FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1712.05520

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.

Related

• On the orders of composition factors in completely reducible groups
• Bounds for Finite Semiprimitive Permutation Groups: Order, Base Size,\n and Minimal Degree
• Coprime subdegrees for primitive permutation groups and completely\n reducible linear groups
• About the length of laws for finite groups
• Short words of infinite order