SearcharxivSearch

arXiv · 1806.05529

On the nilpotency class of finite groups with a Frobenius group of automorphisms

Abstract

Suppose that a metacyclic Frobenius group $FH$, with kernel $F$ and complement $H$, acts by automorphisms on a finite group $G$, in such a way that $C_G(F)$ is trivial and $C_G(H)$ is nilpotent. It is known that $G$ is nilpotent and its nilpotency class can be bounded in terms of $|H|$ and the nilpotency class of $C_G(H)$. Until now, it was not clear whether the bound could be made independent of the order of $H$. In this article, we construct a family $\mathfrak{G}$ of finite nilpotent groups, of unbounded nilpotency class. Each group in $\mathfrak{G}$ admits a metacyclic Frobenius group of automorphisms such that the centralizer of the kernel is trivial and the centralizer of the complement is abelian. This shows that the dependence of the bound on the order of $H$ is essential.

Explore related subjects

Keep this discovery

BibTeXRIS

Valentina Iusa. 2018-06-14. On the nilpotency class of finite groups with a Frobenius group of automorphisms. https://arxiv.org/abs/1806.05529

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