SearcharxivSearch

arXiv · 1801.06738

Two classes of finite groups whose Chermak-Delgado lattice is a chain of length zero

Abstract

It is an open question in the study of Chermak-Delgado lattices precisely which finite groups $G$ have the property that $CD(G)$ is a chain of length $0$. In this note, we determine two classes of groups with this property. We prove that if $G=AB$ is a finite group, where $A$ and $B$ are abelian subgroups of relatively prime orders with $A$ normal in $G$, then the Chermak-Delgado lattice of $G$ equals $\{AC_B(A)\}$, a strengthening of earlier known results.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryan McCulloch, Marius Tărnăuceanu. 2018-01-20. Two classes of finite groups whose Chermak-Delgado lattice is a chain of length zero. https://doi.org/10.1080/00927872.2017.1404090

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