Enumerating finite racks, quandles and kei

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages

Scientific paper

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

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Enumerating finite racks, quandles and kei does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating finite racks, quandles and kei, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating finite racks, quandles and kei will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-57733

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.