An upper bound for the nonsolvable length of a finite group in terms of its shortest law

preprint2022arXivOpen access

Abstract

Every finite group GG has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in GG, is called the \emph{nonsolvable length} λ(G)λ(G) of GG. In the present paper, we prove a theorem about permutation representations of groups of fixed nonsolvable length. As a consequence, we show that in a finite group of nonsolvable length at least nn, no non-trivial word of length at most nn (in any number of variables) can be a law. This result is then used to give a bound on λ(G)λ(G) in terms of the length of the shortest law of GG, thus confirming a conjecture of Larsen. Moreover our Theorem C can be used to give a positive answer, in the case p=2p=2, to a problem raised by Khukhro and Shumyatsky, concerning the non-pp-solvable length of finite groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.