Enumerating Finite Racks, Quandles and Kei

Simon R. Blackburn

Abstract


A rack of order $n$ is a binary operation $\vartriangleright$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\vartriangleright)$ is a rack provided that the map $x\mapsto x\vartriangleright y$ is a bijection for all $y\in X$, and $(x\vartriangleright y)\vartriangleright z=(x\vartriangleright z)\vartriangleright (y\vartriangleright z)$ for all $x,y,z\in X$.

The paper provides upper and lower bounds of the form $2^{cn^2}$ on the number of isomorphism classes of racks of order $n$. Similar results on the number of isomorphism classes of quandles and kei are obtained. The results of the paper are established by first showing how an arbitrary rack is related to its operator group (the permutation group on $X$ generated by the maps $x\mapsto x\vartriangleright y$ for $y\in Y$), and then applying some of the theory of permutation groups. The relationship between a rack and its operator group extends results of Joyce and of Ryder; this relationship might be of independent interest.


Keywords


Racks; Quandles; Kei; Asymptotic Enumeration

Full Text: PDF