Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2211.14910

On groups with few subgroups not in the Chermak-Delgado lattice

David Burrell·William Cocke·Ryan McCulloch
View original source ↗Read source document ↗Export metadata ↓

Abstract

We investigate the question of how many subgroups of a finite group are not in its Chermak-Delgado lattice. The Chermak-Delgado lattice for a finite group is a self-dual lattice of subgroups with many intriguing properties. Fasol\u{a} and T\u{a}rn\u{a}uceanu asked how many subgroups are not in the Chermak-Delgado lattice and classified all groups with two or less subgroups not in the Chermak-Delgado lattice. We extend their work by classifying all groups with less than five subgroups not in the Chermak-Delgado lattice. In addition, we show that a group with less than five subgroups not in the Chermak--Delgado lattice is nilpotent. In this vein we also show that the only non-nilpotent group with five or fewer subgroups in the Chermak-Delgado lattice is S_3.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

David Burrell, William Cocke, Ryan McCulloch. 2022-11-27. On groups with few subgroups not in the Chermak-Delgado lattice. https://doi.org/10.1007/s40598-023-00237-2

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↗