Search arXivSearch

arXiv · 2602.08875

On medial Latin quandles and affine modules

Abstract

In this note, we show that the category of Latin (resp. commutative) medial quandles is equivalent to the category of affine modules over a certain Laurent polynomial ring (resp. the dyadic rationals). As applications, we describe free objects in these categories and obtain a structure theorem for finitely generated medial commutative quandles. We also characterize racks whose duals are commutative. Collectively, this solves two open problems of Bardakov and Elhamdadi (arXiv:2601.07057).

Explore related subjects

Keep this discovery

BibTeXRIS

Luc Ta. 2026-02-09. On medial Latin quandles and affine modules. https://doi.org/10.4153/s0008439526102306

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