Search arXiv⌕ 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

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR↗
arXiv2026

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR↗
arXiv2026

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR↗