Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

In the literature, one sometimes sees the claim that finitely presented quandles (in particular, knot quandles) are "hard to deal with". Hence, a great deal of effort has gone into studying finite quandles and counting homomorphisms onto them, and so on. However, I have not yet come across any theorems that state formal undecidability results for finitely presented quandles similar to those for finitely presented groups. In fact, I have yet to see any formulation of such problems. (For instance, a theorem stating that the isomorphism problem is undecidable for finitely presented quandles.)

Do such results exist in the literature and, if so, could someone please provide references?

EDIT: (Asked same question on Math Overflow)

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.