SearcharxivSearch

arXiv · 1412.8418

On finite groups where the order of every automorphism is a cycle length

Abstract

Using Frobenius normal forms of matrices over finite fields as well as the Burnside Basis Theorem, we give a direct proof of Horo\v{s}evski\u{i}'s result that every automorphism $\alpha$ of a finite nilpotent group has a cycle whose length coincides with $\mathrm{ord}(\alpha)$. Also, we give two new sufficient conditions for an automorphism $\alpha$ of an arbitrary finite group to satisfy this property, namely when $\mathrm{ord}(\alpha)$ is a product of at most two prime powers or when $\alpha$ has a sufficiently large cycle. This will allow us to show that the least order of a group where this property is violated is 120. Finally, we observe that any finite group embeds both into a group with this property (as all finite symmetric groups enjoy the property) as well as into a finite group not having this property.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Bors. 2014-12-29. On finite groups where the order of every automorphism is a cycle length. https://arxiv.org/abs/1412.8418

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