SearcharxivSearch

arXiv · 2206.12758

Central Products and the Chermak-Delgado Lattice

Abstract

The Chermak-Delgado lattice of a finite group is a modular, self-dual sublattice of the lattice of subgroups. We prove that the Chermak-Delgado lattice of a central product contains the product of the Chermak-Delgado lattices of the relevant central factors. Furthermore, we obtain information about heights of elements in the Chermak-Delgado lattice relative to their heights in the Chermak-Delgado lattices of central factors. We also explore how the central product can be used as a tool in investigating Chermak-Delgado lattices.

Explore related subjects

Keep this discovery

BibTeXRIS

William Cocke, Ryan McCulloch. 2022-06-26. Central Products and the Chermak-Delgado Lattice. https://doi.org/10.1016/j.jpaa.2024.107769

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