Skip to Main content Skip to Navigation
Journal articles

Minimum Number of Colors: the Turk’s Head Knots Case Study

Abstract : An $r$-coloring of a knot diagram is an assignment of integers modulo $r$ to the arcs of the diagram such that at each crossing, twice the the number assigned to the over-arc equals the sum of the numbers assigned to the under-arcs, modulo $r$. The number of $r$-colorings is a knot invariant i.e., for each knot, it does not depend on the diagram we are using for counting them. In this article we calculate the number of $r$-colorings for the so-called Turk's Head Knots, for each modulus $r$. Furthermore, it is also known that whenever a knot admits an $r$-coloring using more than one color then all other diagrams of the same knot admit such $r$-colorings (called non-trivial $r$-colorings). This leads to the question of what is the minimum number of colors it takes to assemble such an $r$-coloring for the knot at issue. In this article we also estimate and sometimes calculate exactly what is the minimum numbers of colors for each of the Turk's Head Knots, for each relevant modulus $r$.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01349054
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, July 26, 2016 - 5:19:05 PM
Last modification on : Thursday, September 7, 2017 - 1:03:44 AM

File

2111-9719-1-PB.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-01349054, version 1

Collections

Citation

Pedro Lopes, João Matias. Minimum Number of Colors: the Turk’s Head Knots Case Study. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, Vol. 17 no.2 (2), pp.1-30. ⟨hal-01349054⟩

Share

Metrics

Record views

112

Files downloads

1189