Search arXivSearch

arXiv · 2201.08607

Fitting height of finite groups admitting a fixed-point-free automorphism satisfying an additional polynomial identity

Abstract

Let $f(x)$ be a non-zero polynomial with integer coefficients. An automorphism $\varphi$ of a group $G$ is said to satisfy the elementary abelian identity $f(x)$ if the linear transformation induced by $\varphi$ on every characteristic elementary abelian section $S$ of $G$ is annihilated by $f(x)$. We prove that if a finite (soluble) group $G$ admits a fixed-point-free automorphism $\varphi$ satisfying an elementary abelian identity $f(x)$, where $f(x)$ is a primitive polynomial, then the Fitting height of $G$ is bounded in terms of $\operatorname{deg}(f(x))$. We also prove that if $f(x)$ is any non-zero polynomial and $G$ is a $\sigma'$-group for a finite set of primes $\sigma=\sigma(f(x))$ depending only on $f(x)$, then the Fitting height of $G$ is bounded in terms of the number $\operatorname{irr}(f(x))$ of irreducible factors in the decomposition of $f(x)$. These bounds for the Fitting height are stronger than the well-known bounds in terms of the composition length $\alpha (|\varphi|)$ of $\langle\varphi\rangle$ when $\operatorname{deg} (f(x))$ or $\operatorname{irr}(f(x))$ is small in comparison with $\alpha (|\varphi|)$.

Explore related subjects

Keep this discovery

BibTeXRIS

E. I. Khukhro, W. A. Moens. 2022-01-21. Fitting height of finite groups admitting a fixed-point-free automorphism satisfying an additional polynomial identity. https://arxiv.org/abs/2201.08607

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