SearcharxivSearch

arXiv · 2504.12789

Enumeration of solvable cube-free groups and counting certain types of split extensions

Abstract

A group is said to be cube-free if its order is not divisible by the cube of any prime. Let $f_{cf,sol}(n)$ denote the isomorphism classes of solvable cube-free groups of order $n$. We find asymptotic bounds for $f_{cf,sol}(n)$ in this paper. Let $p$ be a prime and let $q = p^k$ for some positive integer $k$. We also give a formula for the number of conjugacy classes of the subgroups that are maximal amongst non-abelian solvable cube-free $p'$-subgroups of ${\rm GL}(2,q)$. Further, we find the exact number of split extensions of $P$ by $Q$ up to isomorphism of a given order where $P \in \{{\mathbb Z}_p \times {\mathbb Z}_p, {\mathbb Z}_{p^{\alpha}}\}$, $p$ is a prime, $\alpha$ is a positive integer and $Q$ is a cube-free abelian group of odd order such that $p \nmid |Q|$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Prashun Kumar, Geetha Venkataraman. 2025-04-17. Enumeration of solvable cube-free groups and counting certain types of split extensions. https://arxiv.org/abs/2504.12789

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