SearcharxivSearch

arXiv · 2410.04127

Subrack Lattices of Conjugation Racks

Abstract

A rack is a set with a binary operation such that left multiplications are automorphisms of the set and a quandle is a rack satisfying a certain condition. Let $S$ be a subset of a finite group $G$ which is closed under the conjugation operation $a\triangleright b := aba^{-1}$. The set $S$ with the conjugation operation $\triangleright$ is a quandle. We call those objects \emph{conjugation racks}. The prime examples are \begin{itemize} \item the group rack $(G,\triangleright)$, \item the conjugacy class rack $(C,\triangleright)$, where $C$ is a conjugacy class in $G$, and \item the $p$-power rack $(G_p,\triangleright)$, where $p$ is a prime and $G_p$ is the set of all elements in $G$ whose order is a power of $p$. \end{itemize} The set of all subracks of a finite rack form a lattice under inclusion. In this paper we study the subrack lattices of the conjugation racks. In particular, we show that the subrack lattice can be associated with a subposet of a partition lattice as well as with a subposet of an integer partition lattice in a canonical way if the rack is connected. And, if the rack is not connected, the study of the homotopy properties of the subrack lattice can be reduced into the study of the homotopy properties of the subposet of parabolic subracks. We also prove that for a certain class of $p$-power racks the order of a Sylow $p$-subgroup divides the reduced Euler characteristic of the subrack lattice of the $p$-power rack. This statement can be considered as the rack analogue of a result by Brown in the field of subgroup complexes regarding the Euler characteristic of the poset of nontrivial $p$-subgroups of a group.

Explore related subjects

Keep this discovery

BibTeXRIS

Selçuk Kayacan. 2024-10-05. Subrack Lattices of Conjugation Racks. https://arxiv.org/abs/2410.04127

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