The palette numbers of torus knots
Abstract
For an effectively n-colorable knot K, the palette number C∗n(K) is the minimum number of distinct colors for all effective n-colorings of K. It is known that C∗n(K)≥2+⌊log2n⌋ for any effectively n-colorable knot K. In this paper, we show that for any odd n≥3 and effectively n-colorable torus knot K it holds that C∗n(K)=2+⌊log2n⌋ namely, any effectively n-colorable torus knot has an effectively n-colored diagram with 2+⌊log2n⌋ colors.