SearcharxivSearch

arXiv · 1812.10554

Some remarks on the subrack lattice of finite racks

Abstract

The set of all subracks $\mathcal{R}(X)$ of a finite rack $X$ form a lattice under inclusion. We prove that if a rack $X$ satisfies a certain condition then the homotopy type of the order complex of $\mathcal{R}(X)$ is a $(m-2)$-sphere, where $m$ is the number of maximal subracks of $X$. The rack $X$ satisfying the condition of this general result is necessarily decomposable. Two particular instances occur when \begin{itemize} \item $X=G$ is a group rack, and when \item $X=C$ is a conjugacy class rack of a nilpotent group. \end{itemize} We also studied the subrack lattices of indecomposable racks by focusing on the conjugacy class racks of symmetric or alternating groups and determined the homotopy types of the corresponding order complexes in some cases.

Explore related subjects

Keep this discovery

BibTeXRIS

Selçuk Kayacan. 2018-12-03. Some remarks on the subrack lattice of finite racks. https://arxiv.org/abs/1812.10554

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