SearcharxivSearch

arXiv · 2504.19109

On Simply Connected Quandles

Abstract

In this paper we provide an alternative characterization of finite simply connected quandles involving only cocycles with values in abelian groups of prime size. As a corollary of such a characterization and the classification of connected quandles of size $p^2$ and $p^3$ we obtain a classification of simply connected quandles of size $p^2$ (already obtained with a different method in \cite{VV}) and $p^3$ for $p>3$ using a method that works for quandles of size $p^n$ for arbitrary $n$. We also classify the simply connected quandles within two subclasses of finite involutory quandles: nilpotent latin quandles and core quandles.

Explore related subjects

Keep this discovery

BibTeXRIS

Marco Bonatto. 2025-04-27. On Simply Connected Quandles. https://arxiv.org/abs/2504.19109

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