Search arXivSearch

arXiv · 2203.02537

Groups having all elements off a normal subgroup with prime power order

Abstract

We consider a finite group $G$ with a normal subgroup $N$ so that all elements of $G \setminus N$ have prime power order. We prove that if there is a prime $p$ so that all the elements in $G \setminus N$ have $p$-power order, then either $G$ is a $p$-group or $G = PN$ where $P$ is a Sylow $p$-subgroup and $(G,P,P \cap N)$ is a Frobenius-Wielandt triple. We also prove that if all the elements of $G \setminus N$ have prime power orders and the orders are divisible by two primes $p$ and $q$, then $G$ is a $\{ p, q \}$-group and $G/N$ is either a Frobenius group or a $2$-Frobenius group. If all the elements of $G \setminus N$ have prime power orders and the orders are divisible by at least three primes, then all elements of $G$ have prime power order and $G/N$ is nonsolvable.

Explore related subjects

Keep this discovery

BibTeXRIS

Mark L. Lewis. 2022-03-04. Groups having all elements off a normal subgroup with prime power order. https://arxiv.org/abs/2203.02537

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