有限群不可解长度的一个上界
An upper bound for the nonsolvable length of a finite group in terms of its shortest law
摘要:
每一个有限群$G$都有一个正规级数,它的每个因子要么是一个可解群,要么是一个非交换单群的直积。在$G$中所有可能的这样的级数上得到的不可解因子的最小数目称为$G$的\emph{nonsolvable length} $λ(G)$。本文证明了一个关于定长不可解群的置换表示的定理。因此,我们表明,在一个有限群的nonsolvable长度至少$n$,没有非平凡字的长度最多$n$(在任何数量的变量)可以是一个法律。然后利用这个结果给出了$λ(G)$在$G$最短律长度上的一个界,从而证实了Larsen的一个猜想.此外,在$p=2$情形下,我们的定理C还可用于对Khukhro和Shumyatsky提出的关于有限群的非$p$ -可解长度的问题给出肯定的回答.
英文摘要:
Every finite group $G$ 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 $G$, is called the \emph{nonsolvable length} $λ(G)$ of $G$. 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 $n$, no non-trivial word of length at most $n$ (in any number of variables) can be a law. This result is then used to give a bound on $λ(G)$ in terms of the length of the shortest law of $G$, thus confirming a conjecture of Larsen. Moreover our Theorem C can be used to give a positive answer, in the case $p=2$, to a problem raised by Khukhro and Shumyatsky, concerning the non-$p$-solvable length of finite groups.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。