The journal
Open the journal →The conversation starts in the journal — be the first to post.
About Fox n-coloring
In the mathematical field of knot theory, Fox n-coloring is a method of specifying a representation of a knot group or a group of a link onto the dihedral group of order n where n is an odd integer by coloring arcs in a link diagram. Ralph Fox discovered this method "in an effort to make the subject accessible to everyone" when he was explaining knot theory to undergraduate students at Haverford College in 1956. Fox n-coloring is an example of a conjugation quandle.
Everything about Fox n-coloring →