Subrack lattices of finite solvable and metacyclic groups
Abstract
A group 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 is a finite solvable group and is a finite group whose subrack lattice is isomorphic to that of , then is solvable and the derived length of has the same derived length as . Our second result is that if is a finite metacyclic group and is a group whose subrack lattice is isomorphic to that of , then 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.
Cite
@article{arxiv.2503.06714,
title = {Subrack lattices of finite solvable and metacyclic groups},
author = {Selçuk Kayacan},
journal= {arXiv preprint arXiv:2503.06714},
year = {2026}
}