SearcharxivSearch

arXiv · 2506.21163

Finite groups with nearly half as many cyclic subgroups as elements

Abstract

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American Mathematical Monthly 122.3 (2015): 275-276], an open problem was asked to classify the groups $G$ with $|C(G)|=|G|-r$, where $2 \leq r \leq |G|-1$. In this article, first we show that, for an odd prime $p$, there are infinitely many groups $G$ with $|C(G)|= \frac{|G|}{2}$, $|C(G)|=\frac{|G|}{p^{q-1}}$ (for prime $q\neq p)$, or $|C(G)|=\frac{|G|}{2}+2^{k}, k\geq 0$. Then, we partially answer the open question by classifying finite groups $G$ having $\frac{|G|}{2}-1\leq |C(G)| \leq \frac{|G|}{2}+1$ for some fix values of $\mathcal{O}_{2}(G)$. Finally, we provide a complete list of finite groups $G$ having $|C(G)|=\frac{|G|+(2r+1)}{2}$ for $r\geq-1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vaibhav Chhajer, Sumana Hatui, Palash Sharma. 2025-06-26. Finite groups with nearly half as many cyclic subgroups as elements. https://arxiv.org/abs/2506.21163

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