A lower bound on minimal number of colors for links

2015/07/15 by Kazuhiro Ichihara, Ichihara, Kazuhiro, Eri Matsudo +1
Mathematics · #57M25 #FOS: Mathematics #Geometric Topology (math.GT) #math.GT #msc:57M25

paper · pdf · doi:10.48550/arxiv.1507.04088

7 pages

arxiv created 2015/07/15 · arxiv updated 2015/07/16

Abstract

We show that the minimal number of colors for all effective n-colorings of a link with non-zero determinant is at least 1+log₂ n.

Related

• Minimal coloring number for Z-colorable links
• The Minimal Coloring Number Of Any Non-splittable ℤ-colorable Link Is Four
• Minimal coloring number for ℤ-colorable links II
• On the Maximum Number of Colors for Links
• Minimal coloring number on minimal diagrams for ℤ-colorable links