Related papers: Colourings and the Alexander Polynomial

Every knot can be embedded in the union of finitely many half planes with a common boundary line in such a way that the portion of the knot in each half plane is a properly embedded arc. The minimal number of such half planes is called the…

In 1971, Kunio Murasugi proved a necessary condition on a knot's Alexander polynomial for that knot to be periodic of prime power order. In this paper I present an alternate proof of Murasugi's condition which is subsequently used to extend…

This article is devoted to the properties of the planar triangulations. The conjugated planar triangulation will be introduced and on the base of the properties, which were achieved by the other authors there will be proved some theorems,…

For any knot, the following are equivalent. (1) The infinite cyclic cover has uncountably many finite covers; (2) there exists a finite-image representation of the knot group for which the twisted Alexander polynomial vanishes; (3) the knot…

List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…

Knot polynomials colored with symmetric representations of $SL_q(N)$ satisfy difference equations as functions of representation parameter, which look like quantization of classical ${\cal A}$-polynomials. However, they are quite difficult…

We claim that the recently discovered universal-matrix precursor for the $F$ functions, which define the differential expansion of colored polynomials for twist and double braid knots, can be extended from rectangular to non-rectangular…

We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.

We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers $m, k$, there is no semi-online algorithm that can $k$-colour bottomless rectangles with disjoint boundaries in…

We determine p-colorability of the paradromic rings. These rings arise by generalizing the well-known experiment of bisecting a Mobius strip. Instead of joining the ends with a single half twist, use $m$ twists, and, rather than bisecting…

The aim of this paper is to provide a new characterization of isomorphism classes of generalized Alexander quandles in terms of the underlying groups and their automorphisms. This extends the previous result [4, Theorem 1.4]. Additionally,…

We provide the twisted Alexander polynomials of finite abelian covers over three-dimensional manifolds whose boundary is a finite union of tori. This is a generalization of a well-known formula for the usual Alexander polynomial of knots in…

The explicit formula, which expresses the Alexander polynomials \Delta_{n,3}(t) of torus knots T(n,3) as a sum of the Alexander polynomials \Delta_{k,2}(t) of torus knots T(k,2), is found. Using this result and those from our previous…

The Pontryagin dual of the twisted Alexander module for a d-component link and GL(N,Z) representation is an algebraic dynamical system with an elementary description in terms of colorings of a diagram. In the case of a knot, its associated…

We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This…

Empirical analysis of many colored knot polynomials, made possible by recent computational advances in Chern-Simons theory, reveals their stability: for any given negative N and any given knot the set of coefficients of the polynomial in…

We study the twisted Alexander polynomial $\Delta_{K,\rho}$ of a knot $K$ associated to a non-abelian representation $\rho$ of the knot group into $SL_2(\BC)$. It is known for every knot $K$ that if $K$ is fibered, then for every…

It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…

A table of the families of alternating knots formed by conways is presented. The Conway's function is shown with the use of linear algebra in terms of natural numbers, called conways, that represent the number of crossings along a…

In this paper, we present an extension of MadGraph5_aMC@NLO which is able to evaluate tree-level QCD matrix-elements up to $2\to 6$ (one more particle than before). To achieve this, we implemented Berends-Giele-like recursion, and…