On the length and depth of finite groups (with an appendix by D.R. Heath-Brown)
Timothy C. Burness, Martin W. Liebeck, Aner Shalev

TL;DR
This paper advances the understanding of finite groups by classifying groups of small depth and length, analyzing chain differences, and extending previous classifications of simple groups with new bounds and structural insights.
Contribution
It determines finite groups of depth 3 and 4, classifies simple groups of length at most 9, and explores the chain difference and ratio, extending earlier classifications and results.
Findings
Classified simple groups of length ≤ 9.
Determined finite groups of depth 3 and 4.
Established bounds on chain difference and ratio.
Abstract
An unrefinable chain of a finite group is a chain of subgroups , where each is a maximal subgroup of . The length (respectively, depth) of is the maximal (respectively, minimal) length of such a chain. We studied the depth of finite simple groups in a previous paper, which included a classification of the simple groups of depth . Here we go much further by determining the finite groups of depth and . We also obtain several new results on the lengths of finite groups. For example, we classify the simple groups of length at most , which extends earlier work of Janko and Harada from the 1960s, and we use this to describe the structure of arbitrary finite groups of small length. We also present a number-theoretic result of Heath-Brown, which implies that there are infinitely many non-abelian simple groups of length at…
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 · graph theory and CDMA systems · Coding theory and cryptography
