SearcharxivSearch

arXiv · 2503.06714

Subrack lattices of finite solvable and metacyclic groups

Abstract

A group $G$ with conjugation operation is a rack. We call such racks \emph{group racks}. In this paper we study finite group racks via their subrack lattices. Heckenberger, Shareshian, and Welker proved that the isomorphism type of the subrack lattice of a finite group determines whether the group is solvable. Our first result shows that if $G$ is a finite solvable group and $H$ is a finite group whose subrack lattice is isomorphic to that of $G$, then $H$ is solvable and the derived length of $H$ has the same derived length as $G$. Our second result is that if $G$ is a finite metacyclic group and $H$ is a group whose subrack lattice is isomorphic to that of $G$, then $H/Z(H)$ is metacyclic. As a further application of our analysis of finite metacyclic groups, we answer a question of Heckenberger, Shareshian, and Welker in the affirmative by constructing two finite groups with isomorphic subrack lattices that are not isomorphic as racks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Selçuk Kayacan. 2025-03-09. Subrack lattices of finite solvable and metacyclic groups. https://arxiv.org/abs/2503.06714

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