Symbolic computation with finite quandles

Details Symbolic computation with finite quandles Symbolic computation with finite quandles

2005-08-18

arxiv.org/abs/math/0508351v2

J. Symbolic Comput. 41 (2006) 811-817.

Mathematics

Geometric Topology

6 pages. Version 2 includes some updates and corrections. Code has been relocated to www.esotericka.org/quandles. To appear in

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Symbolic computation with finite quandles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Symbolic computation with finite quandles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic computation with finite quandles will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120280