The minimization of the number of colors is different at p = 11

DOI10.1142/S0218216515500273MaRDI QIDQ5262986zbMATH OpenFDO

Authors

Publication date 10 July 2015

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

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

zbMATH Keywords

coloringslinksequivalence classes of coloringsminimal sufficient sets of colorssufficient sets of colorsuniversal minimal sufficient sets of colors

Mathematics Subject Classification ID

Abstract: In this article we present the following new fact for prime p=11. For knots 6_2 and 7_2, mincol_{11} 6_2 = 5 = mincol_{11} 7_2, along with the following feature. There is a pair of diagrams, one for 6_2 and the other one for 7_2, each of them admitting only non-trivial 11-colorings using 5 colors, but neither of them admitting being colored with the sets of 5 colors that color the other one. This is in full contrast with the behavior exhibited by links admitting non-trivial p-colorings over the smaller primes, p=2, 3, 5 or 7. We also prove results concerning obstructions to the minimization of colors over generic odd moduli. We apply these to find the right colors to eliminate from non-trivial colorings. We thus prove that 5 is the minimum number of colors for each knot of prime determinant 11 or 13 from Rolfsen's table.

Recommendations

• Minimal sufficient sets of colors and minimum number of colors
• Three Dimensions of Knot Coloring
• The minimum number of coloring of knots
• Linear Alexander quandle colorings and the minimum number of colors
• Any 7-colorable knot can be colored by four colors
• Applications of colorability to links, wild knots and non-compact knots
• Dehn coloring and the dimer model for knots
• 11-colored knot diagram with five colors
• Any 11-Colorable knot can be colored with at most six colors

Cites work

• AUTOMORPHISM GROUPS OF QUANDLES
• Any 7-colorable knot can be colored by four colors
• Hecke algebra representations of braid groups and link polynomials
• 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

(10)

• The minimum number of Fox colors modulo 13 is 5
• The Teneva game
• On the minimum number of colors for knots
• The pallet graph of a Fox coloring
• Minimal sufficient sets of colors and minimum number of colors
• 11-colored knot diagram with five colors
• The delunification process and minimal diagrams
• The 10-palette number of links
• Surgery description of colored knots
• The 6- and 8-palette numbers of links

This page was built for publication: The minimization of the number of colors is different at p = 11

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