SearcharxivSearch

arXiv · 1706.01431

Finite Groups with a Trivial Chermak-Delgado Subgroup

Abstract

The Chermak-Delgado lattice of a finite group is a modular, self-dual sublattice of the lattice of subgroups of $G$. The least element of the Chermak-Delgado lattice of $G$ is known as the Chermak-Delgado subgroup of $G$. This paper concerns groups with a trivial Chermak-Delgado subgroup. We prove that if the Chermak-Delgado lattice of such a group is lattice isomorphic to a Cartesian product of lattices, then the group splits as a direct product, with the Chermak-Delgado lattice of each direct factor being lattice isomorphic to one of the lattices in the Cartesian product. We establish many properties of such groups and properties of subgroups in the Chermak-Delgado lattice. We define a CD-minimal group to be an indecomposable group with a trivial Chermak-Delgado subgroup. We establish lattice theoretic properties of Chermak-Delgado lattices of CD-minimal groups. We prove an extension theorem for CD-minimal groups, and use the theorem to produce twelve examples of CD-minimal groups, each having different CD lattices. Curiously, quasi-antichain $p$-group lattices play a major role in the author's constructions.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryan McCulloch. 2017-06-05. Finite Groups with a Trivial Chermak-Delgado Subgroup. https://doi.org/10.1515/jgth-2017-0042

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