SearcharxivSearch

arXiv · 2205.07248

On groups in which every element has a prime power order and which satisfy some boundedness condition

Abstract

In this paper we shall deal with periodic groups, in which each element has a prime power order. A group $G$ will be called a $BCP$-group if each element of $G$ has a prime power order and for each $p\in \pi(G)$ there exists a positive integer $u_p$ such that each $p$-element of $G$ is of order $p^i\leq p^{u_p}$. A group $G$ will be called a $BSP$-group if each element of $G$ has a prime power order and for each $p\in \pi(G)$ there exists a positive integer $v_p$ such that each finite $p$-subgroup of $G$ is of order $p^j\leq p^{v_p}$. Here $\pi(G)$ denotes the set of all primes dividing the order of some element of $G$. Our main results are the following four theorems. Theorem 1: Let $G$ be a finitely generated $BCP$-group. Then $G$ has only a finite number of normal subgroups of finite index. Theorem 4: Let $G$ be a locally graded $BCP$-group. Then $G$ is a locally finite group. Theorem 7: Let $G$ be a locally graded $BSP$-group. Then $G$ is a finite group. Theorem 9: Let $G$ be a $BSP$-group satisfying $2\in \pi(G)$. Then $G$ is a locally finite group.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcel Herzog, Patrizia Longobardi, Mercede Maj. 2022-05-15. On groups in which every element has a prime power order and which satisfy some boundedness condition. https://arxiv.org/abs/2205.07248

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