SearcharxivSearch

arXiv · 1305.2327

Groups Whose Chermak-Delgado Lattice is a Chain

Abstract

For a finite group G with subgroup H the Chermak-Delgado measure of H in G refer to the product of the order of H with the order of its centralizer, C_G(H). The set of all subgroups with maximal Chermak-Delgado measure form a sublattice, CD(G), within the subgroup lattice of G. This paper examines conditions under which the Chermak-Delgado lattice is a chain of subgroups. On the basis of a general result how to extend certain Chermak-Delgado lattices, we construct for any prime p and any non-negative integer n a p-group whose Chermak-Delgado lattice is a chain of length n.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben Brewster, Peter Hauck, Elizabeth Wilcox. 2013-05-10. Groups Whose Chermak-Delgado Lattice is a Chain. https://arxiv.org/abs/1305.2327

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