Search arXivSearch

arXiv · 2304.09747

Complementation of Subquandles

Abstract

Saki and Kiani proved that the subrack lattice of a rack $R$ is necessarily complemented if $R$ is finite but not necessarily complemented if $R$ is infinite. In this paper, we investigate further avenues related to the complementation of subquandles. Saki and Kiani's example of an infinite rack without complements is a quandle, which is neither ind-finite nor profinite. We provide an example of an ind-finite quandle whose subobject lattice is not complemented, and conjecture that profinite quandles have complemented subobject lattices. Additionally, we provide a complete classification of subquandles whose set-theoretic complement is also a subquandle, which we call \textit{strongly complemented}, and provide a partial transitivity criterion for the complementation in chains of strongly complemented subquandles. One technical lemma used in establishing this is of independent interest: the inner automorphism group of a subquandle is always a subquotient of the inner automorphism group of the ambient quandle.

Explore related subjects

Keep this discovery

BibTeXRIS

K. J. Amsberry, J. A. Bergquist, T. A. Horstkamp, M. H. Lee, D. N. Yetter. 2023-04-17. Complementation of Subquandles. https://doi.org/10.2140/involve.2025.18.417

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