Learn More
This work presents a two-stage logic program to find tricolorings of a geometric braid [1]. This software is applied to data from the KnotData digital library of the Mathematica [5] symbolic computing system, revealing errors in that collection. The two algorithms presented below have been implemented in SWI-Prolog [4]. The first produces a crossing(More)
This work presents a method for associating a class of constraint satisfaction problems to a three-dimensional knot. Given a knot, one can build a knot quandle, which is a generally an infinite, free algebra. The desired collection of problems is derived from the finite quotients of the knot quandle by applying theory that relates finite algebras to(More)
This work presents a method for associating a class of constraint satisfaction problems to a three-dimensional knot. Given a knot, one can build a knot quandle, which is generally an infinite free algebra. The desired collection of problems is derived from the set of invariant relations over the knot quandle, applying theory that relates finite algebras to(More)
  • 1