SearcharxivSearch

arXiv · 2006.00641

On core quandles of groups

Abstract

We review the definition of a quandle, and in particular of the core quandle $\mathrm{Core}(G)$ of a group $G$, which consists of the underlying set of $G$, with the binary operation $x\lhd y = x y^{-1} x$. This is an involutory quandle, i.e., satisfies the identity $x\lhd (x\lhd y) = y$ in addition to the other identities defining a quandle. Trajectories $(x_i)_{i\in\mathbb{Z}}$ in groups and in involutory quandles (in the former context, sequences of the form $x_i = x z^i$ where $x,z\in G,$ among other characterizations; in the latter, sequences satisfying $x_{i+1}= x_i\lhd\,x_{i-1})$ are examined. A family of necessary conditions for an involutory quandle to be embeddable in the core quandle of a group is noted. Some implications are established between identities holding in groups and in their core quandles. Upper and lower bounds are obtained on the number of elements needed to generate the quandle $\mathrm{Core}(G)$ for $G$ a finitely generated group. Several questions are posed.

Explore related subjects

Keep this discovery

BibTeXRIS

George M. Bergman. 2020-05-31. On core quandles of groups. https://doi.org/10.1080/00927872.2021.1874400

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