Symbolic computation with finite quandles

From MaRDI portal
Publication:2457366

DOI10.1016/J.JSC.2006.03.002zbMATH Open1125.68141arXivmath/0508351OpenAlexW4206512912MaRDI QIDQ2457366FDOQ2457366


Authors: Richard Henderson, Todd Macedo, Sam Nelson Edit this on Wikidata


Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/0508351




Recommendations




Cites Work


Cited In (13)

Uses Software





This page was built for publication: Symbolic computation with finite quandles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457366)