Peter Golbus
ABSTRACT
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 constraint satisfaction problems. This allows us to develop notions of tractable and NP-complete quandles and knots. In particular, we show that all tricolorable torus knots and all but at most 2 non-trivial knots with 10 or fewer crossings are NP-complete.
- A.-L. Breiland, L. Oesper, and L. Taalman. p-coloring classes of torus knots. Unpublished manuscript, 2005.Google Scholar
- A. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In 43rd IEEE Symposium on Foundations of Computer Science, FOCS '02, pages 649--658, Vancouver, Canada, November 2002. Google ScholarDigital Library
- A. A. Bulatov, P. Jeavons, and A. A. Krokhin. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing, 34(3):720--742, 2005. Google ScholarDigital Library
- S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (STOC'71), pages 151--158, Shaker Heights, Ohio, 1971. Google ScholarDigital Library
- P. Cromwell. Knots and Links. Cambridge University Press, 2004.Google ScholarCross Ref
- H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Monographs in Mathematics. Springer, 2nd edition, 2005.Google Scholar
- T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing, 28:57--104, 1998. Google ScholarDigital Library
- P. Golbus, R. W. McGrail, M. Merling, K. Ober, M. Sharac, and J. Wood. The class of constraint satisfaction problems over a knot. Technical Report number BARD-CMSC-2008-01, Bard College, 2008. http://asc.bard.edu/.Google Scholar
- M. Grohe. The structure of tractable constraint satisfaction problems. In Proceedings of the 31st Symposium on Mathematical Foundations of Computer Science (MFCS'06), volume 4162 of Lecture Notes in Computer Science, pages 58--72, 2006. Google ScholarDigital Library
- M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM, 54(1), March 2007. Google ScholarDigital Library
- D. Hobby and R. N. McKenzie. The Structure of Finite Algebras, volume 76 of Comtemporary Mathematics. American Mathematical Society, Providence, R. I., 1988.Google Scholar
- N. Immerman. Descriptive Complexity. Graduate Texts in Computer Science. Springer, New York, 1999.Google Scholar
- P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200(1--2):185--204, 1998. Google ScholarDigital Library
- P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527--548, July 1997. Google ScholarDigital Library
- P. Jeavons, D. Cohen, and J. Pearson. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence, 24:51--67, 1998. Google ScholarDigital Library
- D. Joyce. A classifying invariant of knots, the knot quandle. Journal of Pure and Applied Algebra, 23:37--66, 1982.Google ScholarCross Ref
- R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum, New York, 1972.Google ScholarCross Ref
- R. W. McGrail and M. Sharac. Correcting the record with knot colorings. Technical Report number BARD-CMSC-2008-04, Bard College, 2008. http://asc.bard.edu/.Google Scholar
- R. W. McGrail and M. Sharac. Tricoloring as a corrective measure. In ACM Communications in Computer Algebra, volume 42, pages 83--85, 2008. Google ScholarDigital Library
- R. N. McKenzie, G. F. McNulty, and W. F. Taylor. Algebras, Lattices, and Varieties, volume I. Wadsworth and Brooks, California, 1987.Google Scholar
- U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7:95--132, 1974.Google Scholar
- J. H. Przytycki. 3-coloring and other elementary invariants of knots. In Knot Theory, volume 42, pages 275--295. Banach Center Publications, 1998.Google Scholar
- H. Reidemeister. Knoten und Gruppen. Abh. Math. Sem. University of Hamburg, 1926.Google Scholar
- D. Rolfsen. Knots and Links, volume 7 of Mathematical Lecture Series. Publish or Perish, 1976.Google Scholar
- T. J. Schaefer. The complexity of satisfiability problems. In Proceeding of the 10th ACM Symposium on the Theory of Computing (STOC'78), pages 216--226, 1978. Google ScholarDigital Library
- R. G. Scharein. KnotPlot: A Program for Viewing Mathematical Knots. Centre for Experimental and Constructive Mathematics, Simon Fraser University, October 2002.Google Scholar
- M. Sipser. The history and status of the P versus NP question. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC'92), pages 603--618, 1992. Google ScholarDigital Library
- A. Szendrei. Term minimal algebras. Algebra Universalis, 32(4):439--477, 1994.Google ScholarCross Ref
- J. Wielemaker. SWI-Prolog 5.6 Reference Manual, April 2006.Google Scholar
Index Terms
- Tricolorable torus knots are NP-complete
Recommendations
Splitting NP-Complete Sets
We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long-standing open question in a surprising way. As a consequence of this unconditional result and recent work by Glaßer et al., complete sets for all of the following ...
B-splines with homogenized knots
The use of homogenized knots for manipulating univariate polynomials by blossoming algorithms is extended to piecewise polynomials. A generalization of the B-spline to homogenized knots is studied. The new B-spline retains the triangular blossoming ...
Comments