{
  "id": "math/0508351",
  "version": "v2",
  "published": "2005-08-18T17:41:17.000Z",
  "updated": "2006-04-18T20:34:57.000Z",
  "title": "Symbolic computation with finite quandles",
  "authors": [
    "Richard Henderson",
    "Todd Macedo",
    "Sam Nelson"
  ],
  "comment": "6 pages. Version 2 includes some updates and corrections. Code has been relocated to www.esotericka.org/quandles. To appear in J. Symbolic Computation",
  "journal": "J. Symbolic Comput. 41 (2006) 811-817.",
  "categories": [
    "math.GT"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2006-04-18T20:34:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "57M27",
      "57-04"
    ],
    "keywords": [
      "finite quandle",
      "symbolic computation",
      "arbitrary binary operation tables",
      "maple implementations",
      "knot quandle"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2005math......8351H"
    }
  }
}