SearcharxivSearch

arXiv · 1512.07594

Finite Groups with 6 or 7 Automorphism Orbits

Abstract

Let $G$ be a group. The orbits of the natural action of $\mbox{Aut}(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. In this paper the finite nonsolvable groups $G$ with $\omega(G) \leq 6$ are classified - this solves a problem posed by Markus Stroppel - and it is proved that there are infinitely many finite nonsolvable groups $G$ with $\omega(G)=7$. Moreover it is proved that for a given number $n$ there are only finitely many finite groups $G$ without nontrivial abelian normal subgroups and such that $\omega(G) \leq n$, generalizing a result of Kohl.

Explore related subjects

Keep this discovery

BibTeXRIS

Alex Carrazedo Dantas, Martino Garonzi, Raimundo Bastos. 2015-12-23. Finite Groups with 6 or 7 Automorphism Orbits. https://doi.org/10.1515/jgth-2017-0001

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