August 7, 2006
This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical mechanics. On the way we prove various (old and new) facts about knots. We relate Fox 3-colorings to Jones and Kauffman polynomials of links and we use this connection to sketch the method of approximating the unknotting number of a knot. We discuss some elementary open problems in knot theory and show that Fox colorings can be useful in trying to solve them. Finally we demonstrate how analysis of Fox colorings can lead us to understand homology and the fundamental group of branched coverings along links.
Similar papers 1
May 11, 2011
This paper is base on talks which I gave in May, 2010 at Workshop in Trieste (ICTP). In the first part we present an introduction to knots and knot theory from an historical perspective, starting from Summerian knots and ending on Fox 3-coloring. We show also a relation between 3-colorings and the Jones polynomial. In the second part we develop the general theory of Fox colorings and show how to associate a symplectic structure to a tangle boundary so that tangles becomes Lag...
August 31, 2018
This paper is an extended account of my "Introductory Plenary talk at Knots in Hellas 2016" conference We start from the short introduction to Knot Theory from the historical perspective, starting from Heraclas text (the first century AD), mentioning R.Llull (1232-1315), A.Kircher (1602-1680), Leibniz idea of Geometria Situs (1679), and J.B.Listing (student of Gauss) work of 1847. We spend some space on Ralph H. Fox (1913-1973) elementary introduction to diagram colorings (19...
August 6, 2017
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in the sense that if a diagram of the knot under study admits such a coloring, then so does any other diagram of the same knot. This is called p-colorability. It is also associated to systems of linear homogeneous equations over the residues mo...
December 29, 2021
A Fox p-colored knot $K$ in $S^3$ gives rise to a $p$-fold branched cover $M$ of $S^3$ along $K$. The pre-image of the knot $K$ under the covering map is a $\dfrac{p+1}{2}$-component link $L$ in $M$, and the set of pairwise linking numbers of the components of $L$ is an invariant of $K$. This powerful invariant played a key role in the development of early knot tables, and appears in formulas for many other important knot and manifold invariants. We give an algorithm for comp...
January 23, 2013
This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each type of coloring rules has an associated rule that must hold at each crossing. For the Alexander Briggs colorings, the rules hold around regions. The relationships...
April 13, 2016
The aim of this survey article is to highlight several notoriously intractable problems about knots and links, as well as to provide a brief discussion of what is known about them.
January 16, 2012
This is a survey talk on one of the best known quantum knot invariants, the colored Jones polynomial of a knot, and its relation to the algebraic/geometric topology and hyperbolic geometry of the knot complement. We review several aspects of the colored Jones polynomial, emphasizing modularity, stability and effective computations. The talk was given in the Mathematische Arbeitstagung June 24-July 1, 2011. Updated the bibliography.
December 5, 2021
We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are colorings by $S_3$ with 4 or 5 colors. In this paper, we show that if a 2-bridge link admits a coloring by $S_3$ with 5 colors, then the link also admits such a coloring with only 4 colors.
October 17, 2019
Knot colorings are one of the simplest ways to distinguish knots, dating back to Reidemeister, and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, knot determinant and number of colorings, and how these can be computed from either the coloring matrix or the Goeritz matrix. We give an elementary approach to this equivalence, without using any algebraic topology. We also compute knot determinant, nullity of pretzel knots with...
October 28, 2011
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on the main ideas and examples.