The Teneva game

DOI10.1142/S0218216512501258MaRDI QIDQ4906458zbMATH OpenOpenAlexFDO

Authors Louis Kauffman, Pedro Lopes

Publication date 11 February 2013

Published in Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1204.5011

zbMATH Keywords

knotstorus knotscoloringsminimum number of colorsdiagramsTeneva transformations

Mathematics Subject Classification ID

Abstract: For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. This expression is t + 2 l -1 where t and l are extracted from the prime p. It is obtained from iterating the so-called Teneva transformations which we introduced in a previous article. With the aid of our estimate we show that the ratio "number of colors needed vs. number of colors available" tends to decrease with increasing modulus p. For instance as of prime 331, the number of colors needed is already one tenth of the number of colors available. Furthermore, we prove that 5 is minimum number of colors needed to non-trivially color T(2, 11) modulo 11. Finally, as a preview of our future work, we prove that 5 is the minimum number of colors modulo 11 for two rational knots with determinant 11.

Recommendations

• On the minimum number of colors for knots
• The minimum number of Fox colors modulo 13 is 5
• The minimization of the number of colors is different at p = 11
• Minimum number of colors: the Turk's head knots case study
• The palette numbers of torus knots

Cites work

• A proof of the Kauffman-Harary conjecture
• Any 7-colorable knot can be colored by four colors
• Knots and graphs. I: Arc graphs and colorings
• MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
• On the minimum number of colors for knots
• The minimum number of Fox colors and quandle cocycle invariants

Cited in

(11)

• How to Win at Tenzi
• The minimum number of Fox colors modulo 13 is 5
• Minimum number of colors: the Turk's head knots case study
• On the Harary-Kauffman Conjecture and Turk's Head Knots
• On the minimum number of colors for knots
• Minimal sufficient sets of colors and minimum number of colors
• MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
• The palette numbers of torus knots
• On the maximum number of colors for links
• The delunification process and minimal diagrams
• The 10-palette number of links

This page was built for publication: The Teneva game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906458)