Enumerating finite racks, quandles and kei (Q396881): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1203.6504 / rank | |||
Normal rank |
Revision as of 14:21, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumerating finite racks, quandles and kei |
scientific article |
Statements
Enumerating finite racks, quandles and kei (English)
0 references
14 August 2014
0 references
Summary: 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 \textit{D. Joyce} [J. Pure Appl. Algebra 23, 37--65 (1982; Zbl 0474.57003)] and of \textit{H. J. Ryder}, The Structure of Racks. University of Warwick, PhD Thesis (1993)]; this relationship might be of independent interest.
0 references
racks
0 references
quandles
0 references
kei
0 references
asymptotic enumeration
0 references