Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2405.12160

Bounds in terms of the number of cyclic subgroups

Xiaofang Gao·Martino Garonzi
View original source ↗Read source document ↗Export metadata ↓

Abstract

A family of groups is called (maximal) cyclic bounded ((M)CB) if, for every natural number $n$, there are only finitely many groups in the family with at most $n$ (maximal) cyclic subgroups. We prove that the family of groups of prime power order is MCB. We also prove that the family of finite groups without cyclic coprime direct factors is CB. As a consequence, a natural number $n \geqslant 10$ is prime if and only if there are only finitely many finite noncyclic groups with precisely $n$ cyclic subgroups.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaofang Gao, Martino Garonzi. 2024-05-20. Bounds in terms of the number of cyclic subgroups. https://arxiv.org/abs/2405.12160

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗