A reduction theorem for nonsolvable finite groups

2018/05/15 by Francesco Fumagalli, Fumagalli, Francesco, Felix Leinen +3
Mathematics · #FOS: Mathematics #Group Theory (math.GR) #math.GR

paper · pdf · doi:10.48550/arxiv.1805.05649

arxiv created 2018/05/15 · arxiv updated 2018/05/16

Abstract

Every finite group G has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the nonsolvable length of the group and denoted by λ(G). For every integer n, we define a particular class of groups of nonsolvable length n, called n-rarefied, and we show that every finite group of nonsolvable length n contains an n-rarefied subgroup. As applications of this result, we improve the known upper bounds on λ(G) and determine the maximum possible nonsolvable length for permutation groups and linear groups of fixed degree resp. dimension.

Cited by

• Group cosets with all elements of equal order

Related

• An upper bound for the nonsolvable length of a finite group in terms of its shortest law
• Nonsoluble and non-p-soluble length of finite groups
• On the length of finite factorized groups
• On the length of a finite group and of its 2-generator subgroups
• Fitting height and lengths of laws in finite solvable groups