- Fox n-coloring
In the mathematical field of

knot theory ,**Fox "n"-coloring**is a method of specifying a representation of aknot group (or alink group ) onto the dihedral group of order "n" where "n" is an odd integer by coloring arcs in alink diagram (the representation itself is also often called a Fox "n"-coloring).Ralph Fox discovered this method (and the special case of tricolorability) around 1960. Fox "n"-coloring is an example of a conjugationquandle .**Definition**Let "L" be a link, and let "G" be the fundamental group of its complement. A representation $ho$of "G" onto $D\_\{2n\}$ the dihedral group of order "2n" is called a Fox "n"-coloring (or simply an "n"-coloring) of "L". A link "L" which admits such a representation is said to be

**"n"-colorable**, and $ho$ is called an "n"-coloring of "L".The link group is generated paths from a basepoint in $S^3$ to the boundary of a tubular neighbourhood of the link, around a meridian of the tubular neighbourhood, and back to the basepoint. By surjectivity of the representation these generators must map to reflections of a regular "n"-gon. Such reflections correspond to elements $ts^i$ of the dihedral group, where "t" is the reflection and "s" is the rotation of the "n"-gon. The generators of the link group given above are in bijective correspondence with arcs of a

link diagram , and if a generator maps to $ts^iin\; D\_\{2p\}$ we color the corresponding arc $iin\; mathbb\{Z\}/pmathbb\{Z\}$. This is called a Fox "n"-coloring of the link diagram, and it satisfies the following properties:*At least two colors are used (by surjectivity of $ho$).

*Around a crossing, the average of the colors of the undercrossing arcs equals the color of the overcrossing arc (because $ho$ is a representation of the link group).A "n"-colored link yields a

3-manifold "M" by taking the (irregular)diheral covering of the 3-sphere branched over "L" withmonodromy given by $ho$. By a theorem of Montesinos and Hilden, and closed oriented 3-manifold may be obtained this way for some knot "K" and $ho$ some tricoloring of "K". This is no longer true when "n" is greater than three.**Number of colorings**The number of distinct Fox "n"-colorings of a link "L", denoted

:$mathrm\{col\}\_n(L),$

is an invariant of the link, which is easy to calculate by hand on any link diagram by coloring arcs according to the coloring rules. When counting colorings, by convention we also consider the case where all arcs are given the same color, and call such a coloring trivial.

For example, the standard minimal crossing diagram of the

Trefoil knot has 9 distinct tricolorings as seen in the figure:

* 3 "trivial" colorings (every arc blue, red, or green)

* 3 colorings with the ordering Blue->Green->Red

* 3 colorings with the ordering Blue->Red->GreenThe set of Fox 'n'-colorings of a link forms an abelian group $C\_n(K),$, where the sum of two "n"-colorings is the "n"-coloring obtained by strandwise addition. This group splits as a direct sum:$C\_n(K)\; cong\; mathbb\; Z\_n\; oplus\; C\_n^0(K),$,where the first summand corresponds to the "n" trivial (constant) colors, and nonzero elements of $C\_n^0(K)$ summand correspond to nontrivial "n"-colorings ("modulo" translations obtained by adding a constant to each strand).

If $\#$ is the

connected sum operator and $L\_1$ and $L\_2$ are links, then:: $mathrm\{col\}\_n(L\_1)\; mathrm\{col\}\_n(L\_2)\; =\; n\; mathrm\{col\}\_n(L\_1\; \#\; L\_2).$**References*** R.H. Crowell, R.H. Fox, "An Introduction to Knot Theory", Ginn and Co., Boston, 1963. MathSciNet |id=0146828

* R.H. Fox, "A quick trip through knot theory", in: M.K. Fort (Ed.), "Topology of 3-Manifolds and Related Topics", Prentice-Hall, NJ, 1961, pp. 120–167. MathSciNet |id=0140099

* R.H. Fox, "Metacyclic invariants of knots and links", Canadian Journal of Mathematics 22 (1970) 193–201. MathSciNet |id=0261584

*Jozef H. Przytycki , " [*http://front.math.ucdavis.edu/math.GT/0608172 3-coloring and other elementary invariants of knots.*] " Banach Center Publications, Vol. 42, "Knot Theory", Warszawa, 1998, 275–295.

*Wikimedia Foundation.
2010.*