SearcharxivSearch

arXiv · 1810.04965

The nilpotency of finite groups with a fix-point-free automorphism satisfying an identity

Abstract

We generalize the positive solution of the Frobenius conjecture and refinements thereof by studying the structure of groups that admit a fix-point-free automorphism satisfying an identity. We show, in particular, that for every polynomial $r(t) = a_0 + a_1 \cdot t + \cdots + a_d \cdot t^d \in \mathbb{Z}[t]$ that is irreducible over $\mathbb{Q}$, there exist (explicit) invariants $a,b,c \in \mathbb{N}$ with the following property. Consider a finite group with a fix-point-free automorphism ${\alpha}:{G}\longrightarrow{G}$ and suppose that for all $x \in G$ we have the equality $x^{a_0} \cdot \alpha(x^{a_1}) \cdot \alpha^2(x^{a_2})\cdots \alpha^d(x^{a_d}) = 1_G.$ Then $G$ is solvable and of the form $A \cdot (B \rtimes (C \times D))$, where $A$ is an $a$-group, $B$ is a $b$-group, $C$ is a nilpotent $c$-group, and $D$ is a nilpotent group of class at most $d^{2^d}$. Here, a group $H$ is said to be an $a$-group (resp. $b$-group or $c$-group) if the order of every $h \in H$ divides some natural power of $a$ (resp. $b$ or $c$).

Explore related subjects

Keep this discovery

BibTeXRIS

Wolfgang Alexander Moens. 2018-10-11. The nilpotency of finite groups with a fix-point-free automorphism satisfying an identity. https://arxiv.org/abs/1810.04965

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