SearcharxivSearch

arXiv · 1501.02736

Nonsoluble Length Of Finite Groups with Commutators of Small Order

Abstract

Let p be a prime. Every finite group G has a normal series each of whose quotients either is p-soluble or is a direct product of nonabelian simple groups of orders divisible by p. The non-p-soluble length of G is defined as the minimal number of non-p-soluble quotients in a series of this kind. We deal with the question whether, for a given prime p and a given proper group variety V, there is a bound for the non-p-soluble length of finite groups whose Sylow p-subgroups belong to V. Let the word w be a multilinear commutator. In the present paper we answer the question in the affirmative in the case where p is odd and the variety is the one of groups in which the w-values have orders dividing a fixed number.

Explore related subjects

Keep this discovery

BibTeXRIS

Yerko Contreras-Rojas, Pavel Shumyatsky. 2015-01-12. Nonsoluble Length Of Finite Groups with Commutators of Small Order. https://doi.org/10.1017/s0305004115000080

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR