On the minimum number of colors for knots

Details On the minimum number of colors for knots On the minimum number of colors for knots

2005-12-04

arxiv.org/abs/math/0512088v4

Mathematics

Geometric Topology

Final version accepted for publication in Adv. in Appl. Math

Scientific paper

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on the features of modular arithmetic. We introduce a sequence of transformations on colored diagrams called Teneva Transformations. Each of these Transformations reduces the number of colors in the diagrams by one (up to a point). This allows us to further decrease the upper bounds on these minima. We conjecture on the value of these minima. We apply these Transformations to rational knots.

Affiliated with

Also associated with

No associations

Rating

On the minimum number of colors for knots does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the minimum number of colors for knots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimum number of colors for knots will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87078