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

DOI10.1142/S0218216515500273zbMath1320.57019arXiv1308.6054MaRDI QIDQ5262986

No author found.

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

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

Mathematics Subject Classification ID

Related Items (4)

Minimal sufficient sets of colors and minimum number of colors ⋮ The delunification process and minimal diagrams ⋮ The 6- and 8-palette numbers of links ⋮ The minimum number of Fox colors modulo 13 is 5

Cites Work

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

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