SearcharxivSearch

arXiv · 2505.05065

A characterization of nilpotent bicyclic groups

Abstract

A group is called $(m,n)$-bicyclic if it can be expressed as a product of two cyclic subgroups of orders $m$ and $n$, respectively. The classification and characterization of finite bicyclic groups have long been important problems in group theory, with applications extending to symmetric embeddings of the complete bipartite graphs. A classical result by Douglas establishes that every bicyclic group is supersolvable. More recently, Fan and Li (2018) proved that every finite $(m,n)$-bicyclic group is abelian if and only if $\gcd(m,\phi(n))=\gcd(n,\phi(m))=1$, where $\phi$ is Euler's totient function. In this paper we generalize this result further and show that every $(m,n)$-bicyclic group is nilpotent if and only if $\gcd(n,\phi(\mathrm{rad}(m)))=\gcd(m,\phi(\mathrm{rad}(n)))=1$, where $\mathrm{rad}(m)$ denotes the radical of $m$ (the product of its distinct prime divisors).

Explore related subjects

Keep this discovery

BibTeXRIS

Kan Hu. 2025-05-08. A characterization of nilpotent bicyclic groups. https://arxiv.org/abs/2505.05065

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