Related papers: Colourings and the Alexander Polynomial
We compose the table of knots in the thickened torus T x I having diagrams with at most 4 crossings. The knots are constructed by the three-step process. First we list regular graphs of degree 4 with at most 4 vertices, then for each graph…
We prove several results about the complexity of the role colouring problem. A role colouring of a graph $G$ is an assignment of colours to the vertices of $G$ such that two vertices of the same colour have identical sets of colours in…
We publish a table of primitive finite-type invariants of order less than or equal to six, for knots of ten or fewer crossings. We note certain mod-2 congruences, one of which leads to a chirality criterion in the Alexander polynomial. We…
The large size limit of matrix integrals with quartic potential may be used to count alternating links and tangles. The removal of redundancies amounts to renormalizations of the potential. This extends into two directions: higher genus and…
Given a knot, we develop methods for finding the braid representative that minimizes the number of simple walks. Such braids lead to an efficient method for computing the colored Jones polynomial of $K$, following an approach developed by…
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…
In this paper, we study distribution of the zeros of the Alexander polynomials of knots and links in S^3. We call a knot or link "real stable" (resp. "circular stable") if all the zeros of its Alexander polynomial are real (resp. unit…
The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for…
Biquandle brackets are a type of quantum enhancement of the biquandle counting invariant for oriented knots and links, defined by a set of skein relations with coefficients which are functions of biquandle colors at a crossing. In this…
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…
This paper discusses reformulations of the problem of coloring plane maps with four colors. We give a number of alternate ways to formulate the coloring problem including a tautological expansion similar to the Penrose Bracket, and an…
Edge-coloring problems with forbidden patterns are decision problems asking to find an edge-coloring of the input graph which avoids a homomorphism from a fixed forbidden family of edge-colored graphs. In the precolored version of these…
A first step in investigating colour symmetries of periodic and nonperiodic patterns is determining the number of colours which allow perfect colourings of the pattern under consideration. A perfect colouring is one where each symmetry of…
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal…
We prove that for any zero {\alpha} of the Alexander polynomial of a two-bridge knot, -3 < Re({\alpha}) < 6. Furthermore, for a large class of two-bridge knots we prove -1<Re({\alpha}).
In this paper we will study properties of twisted Alexander polynomials of knots corresponding to metabelian representations. In particular we answer a question of Wada about the twisted Alexander polynomial associated to the tensor product…
Based on a vanishing theorem for non-fibered knots due to Friedl and Vidussi, we define the twisted Alexander vanishing order of a knot to be the order of the smallest finite group such that the corresponding twisted Alexander polynomial is…
We consider the Alexander polynomial of a plane algebraic curve twisted by a linear representation. We show that it divides the product of the polynomials of the singularity links, for unitary representations. Moreover, their quotient is…
Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…
Morifuji computed the twisted Alexander polynomial of twist knots for nonabelian representations. In this paper we compute the twisted Alexander polynomial and the Reidemeister torsion of genus one two-bridge knots, a class of knots which…