Finite groups having chain difference one (Q687668)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite groups having chain difference one |
scientific article |
Statements
Finite groups having chain difference one (English)
0 references
20 December 1993
0 references
A maximal chain of subgroups of a group \(G\) is an ascending chain of subgroups \(1 = M_ 0 < M_ 1 < \cdots < M_ k = G\) where each \(M_ i\) is a maximal subgroup of \(M_{i+1}\). The length of such a chain is \(k\). The chain difference of a finite group \(G\), \(\text{cd}(G)\), is the length of a longest maximal chain minus the length of a shortest maximal chain. A classical result of K. Iwasawa is: \(\text{cd}(G) = 0\) if and only if \(G\) is supersolvable. Using the classification of finite simple groups, this paper describes the structure of all finite groups \(G\) with \(\text{cd}(G) = 1\).
0 references
maximal chain of subgroups
0 references
maximal subgroup
0 references
chain difference
0 references
supersolvable finite groups
0 references