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.

MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES

    https://doi.org/10.1142/S0218216511009728Cited by:12 (Source: Crossref)

    This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant.

    Specifically, we prove that whenever the least prime divisor of the determinant of such a link and the modulus r is 2, 3, 5, or 7, then the minimum number of colors is 2, 3, 4, or 4 (respectively) and conversely.

    We are thus led to conjecture that for each prime p there exists a unique positive integer, mp, with the following property. For any link L of non-null determinant and any modulus r such that p is the least prime divisor of the determinant of L and the modulus r, the minimum number of colors of L modulo r is mp.

    AMSC: 57M27