Symbolic computation with finite quandles
| dc.creator | Henderson, Richard | |
| dc.creator | Macedo, Todd | |
| dc.creator | Nelson, Sam | |
| dc.date | 2005-08-18 | |
| dc.date | 2006-04-18 | |
| dc.date.accessioned | 2026-07-07T06:42:48Z | |
| dc.date.available | 2026-07-07T06:42:48Z | |
| dc.description | 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. | |
| dc.description | 6 pages. Version 2 includes some updates and corrections. Code has been relocated to www.esotericka.org/quandles. To appear in J. Symbolic Computation | |
| dc.identifier | https://arxiv.org/abs/math/0508351 | |
| dc.identifier | http://arxiv.org/abs/math/0508351 | |
| dc.identifier | J. Symbolic Comput. 41 (2006) 811-817. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/102178 | |
| dc.subject | Geometric Topology | |
| dc.subject | 57M27, 57-04 | |
| dc.title | Symbolic computation with finite quandles | |
| dc.type | text |