Bounding the order of complex linear groups and permutation groups with selected composition factors

2023/03/10 by Geoffrey R. Robinson, Robinson, Geoffrey R.
Mathematics · #20C20 #Advanced Topics in Algebra #Algebraic structures and combinatorial models #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR)

paper · pdf · doi:10.48550/arxiv.2303.06011

openalex publication_date 2023/03/10 · openalex created_date 2023/03/14 · openalex updated_date 2026/07/28

Abstract

Originally motivated by questions of P. Etingof related to growth rates of tensor powers in symmetric tensor categories, we obtain general bounds on the order of finite subgroups of \rm GL(n,ℂ) with restricted composition factors (as usual, modulo Abelian normal subgroups). We place the question in a wider context, and find other applications.

Related

• Bounding the order of finite p^′- subgroups of \rm GL(n,ℂ)
• On the odd order composition factors of finite linear groups
• On the orders of composition factors in completely reducible groups
• The number of composition factors of order p in completely reducible groups of characteristic p
• A bound on element orders in the holomorph of a finite group