Name
Abstract | ||
|---|---|---|
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in a compact, accessible manner, and to show how to use it for computational purposes. In particular, we address how to determine colorability of a knot, and propose to use SAT solving to search for colorings. The computational complexity of the problem, both in theory and in our implementation, is discussed. In the last part, we explain how coloring can be utilized in knot recognition. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-25043-4_7 | Communications in Computer and Information Science |
Field | DocType | Volume |
Discrete mathematics,Algebraic number,Jones polynomial,Mathematical theory,Constraint satisfaction problem,Knot (unit),Mathematics,Computational complexity theory | Journal | 514 |
ISSN | Citations | PageRank |
1865-0929 | 1 | 0.48 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Fish | 1 | 247 | 22.48 |
| Alexei Lisitsa | 2 | 272 | 45.94 |
| David Stanovský | 3 | 17 | 2.56 |