World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

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

    https://doi.org/10.1142/S0218216515500273Cited by:4 (Source: Crossref)

    In this article we present the following new fact for prime p = 11. For knots 62 and 72, mincol11 62 = 5 = mincol11 72, along with the following feature. There is a pair of diagrams, one for 62 and the other one for 72, each of them admitting only non-trivial 11-colorings using five colors, but neither of them admitting being colored with the sets of five colors that color the other one. This new fact 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 finding 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.

    AMSC: 57M27