SearcharxivSearch

arXiv · 1405.1946

On the length of finite groups and of fixed points

Abstract

The generalized Fitting height of a finite group $G$ is the least number $h=h^*(G)$ such that $F^*_h(G)=G$, where the $F^*_i(G)$ is the generalized Fitting series: $F^*_1(G)=F^*(G)$ and $F^*_{i+1}(G)$ is the inverse image of $F^*(G/F^*_{i}(G))$. It is proved that if $G$ admits a soluble group of automorphisms $A$ of coprime order, then $h^*(G)$ is bounded in terms of $h^* (C_G(A))$, where $C_G(A)$ is the fixed-point subgroup, and the number of prime factors of $|A|$ counting multiplicities. The result follows from the special case when $A=\langle\varphi\rangle$ is of prime order, where it is proved that $F^*(C_G(\varphi ))\leqslant F^*_{9}(G)$. The nonsoluble length $\lambda (G)$ of a finite group $G$ is defined as the minimum number of nonsoluble factors in a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. It is proved that if $A$ is a group of automorphisms of $G$ of coprime order, then $\lambda (G)$ is bounded in terms of $\lambda (C_G(A))$ and the number of prime factors of $|A|$ counting multiplicities.

Explore related subjects

Keep this discovery

BibTeXRIS

E. I. Khukhro, P. Shumyatsky. 2014-05-03. On the length of finite groups and of fixed points. https://arxiv.org/abs/1405.1946

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