SearcharxivSearch

arXiv · 2405.04141

Element orders in extraspecial groups

Abstract

By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic subgroups of any (generalized/almost) extraspecial group. For a finite group $G$, the ratio of the number of cyclic subgroups to the number of subgroups is called the cyclicity degree of $G$ and is denoted by $cdeg(G)$. We show that the set containing the cyclicity degrees of all finite groups is dense in $[0, 1]$. This is equivalent to giving an affirmative answer to the following question posed by T\'{o}th and T\u{a}rn\u{a}uceanu: ``For every $a\in [0, 1]$, does there exist a sequence $(G_n)_{n\geq 1}$ of finite groups such that $\displaystyle\lim_{n\to\infty} cdeg(G_n)=a$?". We show that such sequences are formed of finite direct products of extraspecial groups of a specific type.

Explore related subjects

Keep this discovery

BibTeXRIS

Mihai-Silviu Lazorec. 2024-05-07. Element orders in extraspecial groups. https://arxiv.org/abs/2405.04141

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