SearcharxivSearch

arXiv · 2211.13360

Constructing an infinite family of quandles from a quandle

Abstract

Quandles are self-distributive, right-invertible, idempotent algebras. A group with conjugation for binary operation is an example of a quandle. Given a quandle $(Q, \ast)$ and a positive integer $n$, define $a\ast_n b = (\cdots (a\ast \underbrace{b)\ast \cdots )\ast b}_{n}$, where $a, b \in Q$. Then, $(Q, \ast_n)$ is again a quandle. We set forth the following problem. ``Find $(Q, \ast)$ such that the sequence $\{(Q, \ast_n)\, :\, n\in \mathbb{Z}^+ \}$ is made up of pairwise non-isomorphic quandles.'' In this article we find such a quandle $(Q, \ast)$. We study the general linear group of $2$-by-$2$ matrices over $\mathbb{C}$ as a quandle under conjugation. Its (algebraically) connected components, that is, its conjugacy classes, are subquandles of it. We show the latter are connected as quandles and prove rigidity results about them such as the dihedral quandle of order $3$ is not a subquandle for most of them. Then we consider the quandle which is the projective linear group of $2$-by-$2$ matrices over $\mathbb{C}$ with conjugation, and prove it solves the problem above. In the course of this work we prove a sufficient and necessary condition for a quandle to be latin. This will reduce significantly the complexity of algorithms for ascertaining if a quandle is latin.

Explore related subjects

Keep this discovery

BibTeXRIS

Pedro Lopes, Manpreet Singh. 2022-11-24. Constructing an infinite family of quandles from a quandle. https://arxiv.org/abs/2211.13360

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