Abstract
Every finite group 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 , is called the \emph{nonsolvable length} of . 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 , no non-trivial word of length at most (in any number of variables) can be a law. This result is then used to give a bound on in terms of the length of the shortest law of , thus confirming a conjecture of Larsen. Moreover our Theorem C can be used to give a positive answer, in the case , to a problem raised by Khukhro and Shumyatsky, concerning the non--solvable length of finite groups.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.