Minimal sufficient sets of colors and minimum number of colors

DOI10.1142/S0218216517430088zbMATH Open1377.57015arXiv1501.02421OpenAlexW2963956265MaRDI QIDQ5357451FDOQ5357451

Authors: Jun Ge, Xianan Jin, Louis Kauffman, Pedro Lopes, Lianzhu Zhang 

Publication date: 8 September 2017

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

Abstract: In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proofs of mincol_p L geq 5 for p geq 11 and mincol_p L geq 6 for p geq 17. We elaborate on equivalence classes of sets of distinct colors (on a given modulus) and prove that there are two such classes of five colors modulo 11, and only one such class of five colors modulo 13. Finally, we give a positive answer to a question raised by Nakamura, Nakanishi, and Satoh concerning an inequality involving crossing numbers. We show it is an equality only for the trefoil and for the figure-eight knots.

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

Recommendations

• The minimization of the number of colors is different at p = 11
• The minimum number of coloring of knots
• The minimum number of Fox colors modulo 13 is 5
• On the minimum number of Fox colorings of knots
• Fox coloring and the minimum number of colors

zbMATH Keywords

minimum number of colorslink coloringsequivalence classes of coloringsminimal sufficient sets of colors

Mathematics Subject Classification ID

Cites Work

• A quick trip through knot theory
• Alternating sum formulae for the determinant and other link invariants
• Knots and graphs. I: Arc graphs and colorings
• On the minimum number of colors for knots
• The minimum number of Fox colors and quandle cocycle invariants
• MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
• The Teneva game
• Equivalence classes of colorings
• The minimization of the number of colors is different at p = 11
• AUTOMORPHISM GROUPS OF QUANDLES
• Any 7-colorable knot can be colored by four colors
• 5-colored knot diagram with four colors
• 11-colored knot diagram with five colors
• A lower bound on minimal number of colors for links
• The pallet graph of a Fox coloring
• The minimum number of Fox colors modulo 13 is 5
• Any 11-Colorable knot can be colored with at most six colors

Cited In (6)

• The minimum number of Fox colors modulo 13 is 5
• An improvement of the lower bound for the minimum number of link colorings by quandles
• 11-colored knot diagram with five colors
• The minimization of the number of colors is different at p = 11
• On the minimum number of Fox colorings of knots
• Minimum number of palettes in edge colorings

This page was built for publication: Minimal sufficient sets of colors and minimum number of colors

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