The Mathematica Book
Tricolorable torus knots are NP-complete
Proceedings of the 47th Annual Southeast Regional Conference
| Hi-index | 0.00 |
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 relation from a Knotdata braid word and the second searches for tricolorings given a crossing relation.