SearcharxivSearch

arXiv · 0710.4289

Finite groups with an automorphism cubing a large fraction of elements

Abstract

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense, close to abelian. We prove two theorems. In the first, we completely classify all finite groups with an automorphism cubing more than half their elements. All such groups are either nilpotent class 2 or have an abelian subgroup of index at most 2. For our second theorem we show that, if a group possesses an automorphism sending more than 4/15 of its elements to their cubes, then it must be solvable. The group A_5 shows that this result is best possible. Both our main findings closely parallel results of previous authors on finite groups possessing an automorphism which inverts many group elements. The technicalities of the new proofs are somewhat more subtle, and also throw up a nice connection to a basic problem in combinatorial number theory, namely the study of subsets of finite cyclic groups which avoid non-trivial solutions to one or more translation invariant linear equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter Hegarty. 2007-10-23. Finite groups with an automorphism cubing a large fraction of elements. https://arxiv.org/abs/0710.4289

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