SearcharxivSearch

arXiv · 2408.09214

The Number of Subgroups and Cyclic Subgroups of Finite Group and Its Application by GAP Program

Abstract

In this paper, we present a novel approach for calculating the set of subgroups of a finite group, focusing on cyclic subgroups, and using it to establish the quantity of all subgroups in the direct product of two groups. Specifically, we consider the Dicyclic group of order \(4n\) and the Cyclic group of order \(p\). Let \(\tau(n)\) denote the total number of divisors of \(n\), and \(\sigma(n)\) denote the summation of all divisors of \(n\). Using these functions, we derive a formula for the number of subgroups in the group \(T_{4n} \times C_p\). We then use the computer program GAP to find all \(T_{4n} \times C_p\) with exactly \(|T_{4n} \times C_p| - t\) cyclic subgroups for \(t \geq 1\).

Explore related subjects

Keep this discovery

BibTeXRIS

Abdallah Shihadeh. 2024-08-17. The Number of Subgroups and Cyclic Subgroups of Finite Group and Its Application by GAP Program. https://arxiv.org/abs/2408.09214

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