5 citations · 18 across the 20 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
math.GT2012★ 4 cited
Equivalence Classes of Colorings
Jun Ge, Slavik Jablan, Louis H. Kauffman +1
For any link and for any modulus we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of t…
math.GT2012
On the Maximum Number of Colors for Links
Slavik Jablan, Louis H. Kauffman, Pedro Lopes
For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-t…
math.GT2012
The Teneva Game
Louis Kauffman, Pedro Lopes
For each prime p > 7 we obtain the expression for an upper bound on the minimum number of colors needed to non-trivially color T(2, p), the torus knots of type (2, p), modulo p. Th…