SearcharxivSearch

arXiv · 2403.05926

Groups with supersolvable automorphism group

Abstract

We call a finite group G ultrasolvable if it has a characteristic subgroup series whose factors are cyclic. It was shown by Durbin--McDonald that the automorphism group of an ultrasolvable group is supersolvable. The converse statement was established by Baartmans--Woeppel under the hypothesis that G has no direct factor isomorphic to the Klein four-group. We extend this result by proving that Aut(G) is supersolvable if and only if G is ultrasolvable or G=H\times C_2\times C_2 where H is ultrasolvable of odd order. This corrects an erroneous claim by Corsi Tani. Our proof is more elementary than Baartmans--Woeppel's and uses some ideas of Corsi Tani and Laue.

Explore related subjects

Keep this discovery

BibTeXRIS

Benjamin Sambale. 2024-03-09. Groups with supersolvable automorphism group. https://arxiv.org/abs/2403.05926

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