Geodesic
Minimum Number of Colors: the Turk’s Head Knots Case Study
Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 2.

Voir la notice de l'article provenant de la source Episciences

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$. 
@article{DMTCS_2015_17_2_a11,
     author = {Lopes, Pedro and Matias, Jo\~ao},
     title = {Minimum {Number} of {Colors:} the {Turk{\textquoteright}s} {Head} {Knots} {Case} {Study}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {2015-2016},
     doi = {10.46298/dmtcs.2139},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2139/}
}
TY  - JOUR
AU  - Lopes, Pedro
AU  - Matias, João
TI  - Minimum Number of Colors: the Turk’s Head Knots Case Study
JO  - Discrete mathematics & theoretical computer science
PY  - 2015-2016
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2139/
DO  - 10.46298/dmtcs.2139
LA  - en
ID  - DMTCS_2015_17_2_a11
ER  - 
%0 Journal Article
%A Lopes, Pedro
%A Matias, João
%T Minimum Number of Colors: the Turk’s Head Knots Case Study
%J Discrete mathematics & theoretical computer science
%D 2015-2016
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2139/
%R 10.46298/dmtcs.2139
%G en
%F DMTCS_2015_17_2_a11
Lopes, Pedro; Matias, João. Minimum Number of Colors: the Turk’s Head Knots Case Study. Discrete mathematics & theoretical computer science, Tome 17 (2015-2016) no. 2. doi : 10.46298/dmtcs.2139. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2139/

Cité par Sources :