pith. sign in

arxiv: math/0509365 · v4 · submitted 2005-09-15 · 🧮 math.GT

Matrices and finite Alexander quandles

classification 🧮 math.GT
keywords alexanderquandlealgorithmfinitedescribedeterminingfindinggive
0
0 comments X
read the original abstract

We describe an algorithm for determining whether a finite quandle is isomorphic to an Alexander quandle by finding all possible Alexander presentations of the quandle. We give an implementation of this algorithm in Maple.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.