Symbolic computation with finite quandles
Geometric Topology
2007-05-23 v2
Abstract
Algorithms are described and Maple implementations are provided for finding all quandles of order , as well as computing all homomorphisms between two finite quandles or from a finitely presented quandle (e.g., a knot quandle) to a finite quandle, computing the automorphism group of a finite quandle, etc. Several of these programs work for arbitrary binary operation tables and hence algebraic structures other than quandles. We also include a stand-alone C program which finds quandles of order and provide URLs for files containing the results for 7 and 8.
Cite
@article{arxiv.math/0508351,
title = {Symbolic computation with finite quandles},
author = {Richard Henderson and Todd Macedo and Sam Nelson},
journal= {arXiv preprint arXiv:math/0508351},
year = {2007}
}
Comments
6 pages. Version 2 includes some updates and corrections. Code has been relocated to www.esotericka.org/quandles. To appear in J. Symbolic Computation