arXiv · math/0508351
Symbolic computation with finite quandles
Abstract
Algorithms are described and Maple implementations are provided for finding all quandles of order $n$, 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 $n$ and provide URLs for files containing the results for $n=6,$ 7 and 8.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Richard Henderson, Todd Macedo, Sam Nelson. 2006-04-18. Symbolic computation with finite quandles. https://searcharxiv.com/abs/math/0508351
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.