Bounding the order of complex linear groups and permutation groups with selected composition factors
Geoffrey R. Robinson

TL;DR
This paper establishes bounds on the size of finite subgroups of complex linear groups with specific composition factors, motivated by tensor category growth questions, and explores broader applications.
Contribution
It provides new bounds on the order of finite subgroups of GL(n,C) with restricted composition factors, extending previous understanding.
Findings
Derived bounds for subgroup orders with certain composition factors
Connected bounds to growth rates in tensor categories
Applied results to broader group-theoretic contexts
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 with restricted composition factors (as usual, modulo Abelian normal subgroups). We place the question in a wider context, and find other applications.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Algebraic structures and combinatorial models · Advanced Topics in Algebra
