Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2208.01415

CLT-groups with cyclic or abelian subgroups

Khyati Sharma·A. Satyanarayana Reddy
View original source ↗Read source document ↗Export metadata ↓

Abstract

A finite group is called a CLT-group if it contains a subgroup corresponding to every divisor of the order of the group. It is said to be a Cyclic (Abelian) CLT group if it contains a cyclic (abelian) subgroup corresponding to every proper divisor of the order of the group. A natural number is said to be a CCLT (ACLT) number if every group of that order is a cyclic (abelian) CLT group. In this work, we classify all CCLT and ACLT numbers and study various properties of Cyclic (Abelian) CLT groups. We also show that the classes of CCLT and ACLT groups are contained in the class of supersolvable groups. Moreover, we introduce the function CCLT-degree on the set of non-cyclic finite groups and study the properties of this function.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Khyati Sharma, A. Satyanarayana Reddy. 2022-07-30. CLT-groups with cyclic or abelian subgroups. https://arxiv.org/abs/2208.01415

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↗