arXiv research

It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on minimal diagrams of $\mathbb{Z}$-colorable links. We show, for any positive integer $N…

A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (…

We determine the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on the standard minimal diagrams of $\mathbb{Z}$-colorable torus links. Also included are complete classifications of such $\mathbb{Z}$-colorings and of such $\mathbb{Z}$-colorings by only four colors, which are shown by using rack colorin…

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also prove a similar result for any $11$-colorable ribbon $2$-knot.

Clarifies how knot homset invariants relate to diagram colorings.

Generalizes region select game to $k$-colored knot diagrams.

Study on knots using 17 colors, finding specific color assignments.

A virtual doodle is an equivalence class of virtual diagrams under an equivalence relation generated by flat version of classical Reidemesiter moves and virtual Reidemsiter moves such that Reidemeister moves of type 3 are forbidden. In this paper we discuss colorings of virtual diagrams using an algebra, called a doodl…

Racks do not give us invariants of surface-knots in general. For example, if a surface-knot diagram has branch points (and a rack which we use satisfies some mild condition), then it admits no rack colorings. In this paper, we investigate rack colorings for surface-knot diagrams without branch points and prove that rac…

For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is the minimal number of colors for non-trivial Z-colorings on diagrams of the link.…

The paper extends surface link coloring theory to triplane diagrams and knots.

Study on coloring virtual tangles with integer and modular arithmetic.

In this article we show that if a knot diagram admits a non-trivial coloring modulo 13 then there is an equivalent diagram which can be colored with 5 colors. Leaning on known results, this implies that the minimum number of colors modulo 13 is 5.

New link invariants from diagram colorings match link widths.

We conjecture a closed-form expression of HOMFLY-PT invariants of double twist knots colored by rectangular Young diagrams where the twist is encoded in interpolation Macdonald polynomials. We also put forth a conjecture of cyclotomic expansions of HOMFLY-PT polynomials colored by rectangular Young diagrams for any kno…

New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.

New R-equivalence classes found for torus knot diagrams.

The state-sum invariants for knots and knotted surfaces defined from quandle cocycles are described using the Kronecker product between cycles represented by colored knot diagrams and a cocycle of a finite quandle used to color the diagram. Such an interpretation is applied to evaluating the invariants. Algebraic inter…

We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under increasing the number of twists in the twist regions of the link diagram. This gives us an infinite family of $q$-power series derived from the colored Jones polynomial parametrized by the color and the twist regions of …

We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of a quandle cocycle invariant, we determine the necessity of Reidemeister moves of…

The paper classifies palettes of Dehn colorings for spatial graphs.

The extreme degrees of the colored Jones polynomial of any link are bounded in terms of concrete data from any link diagram. It is known that these bounds are sharp for semi-adequate diagrams. One of the goals of this paper is to show the converse; if the bounds are sharp then the diagram is semi-adequate. As a result,…

In this paper, we study the colorability of link diagrams by the Alexander quandles. We show that if the reduced Alexander polynomial $Δ_{L}(t)$ is vanishing, then $L$ admits a non-trivial coloring by any non-trivial Alexander quandle $Q$, and that if $Δ_{L}(t)=1$, then $L$ admits only the trivial coloring by any Alexa…

The minimal coloring number of a $\mathbb{Z}$-colorable link is the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable $\mathbb{Z}$-colorable links is four. As an example, we consider the link obtained by…

The paper proves a generalized Kauffman-Harary conjecture for prime determinant links.

For any link and for any modulus $m$ we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…

Categorifies a skein relation for links colored by one-column Young diagrams.

An algorithm determines knot colorability and determinants from petal projections.

Geometric representations of cycles in quandle homology theory are given in terms of colored knot diagrams. Abstract knot diagrams are generalized to diagrams with exceptional points which, when colored, correspond to degenerate cycles. Bounding chains are realized, and used to obtain equivalence moves for homologous c…

The Penrose-Kauffman polynomial connects knot theory to graph coloring.

The paper constructs Goeritz matrices from Dehn colorings.

We discuss the connection between colorings of a link diagram and the Goeritz matrix.

Parallelization technique for welded links preserves equivalence and yields specific decompositions.

We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a categorification of MOY polynomial. For the essential colored planar diagrams with additional…

The paper introduces groupoid racks for spatial surfaces.

The paper connects Kirby diagrams and 5-colored graphs to represent 4-manifolds.

The paper calculates colored Jones polynomials for specific link configurations.

The paper confirms a conjecture and extends arrow polynomial to twisted links.

By means of color chord diagrams we establish a necessary and sufficient condition for $O$-topological equivalence of functions with one essentially critical point on oriented surfaces with edge. We also calculate the number of $O$-topologically non-equivalent functions with one essentially critical point on oriented s…

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 …

Proves existence of colored Khovanov bicomplex linking Jones polynomial.

In this article we take up the calculation of the minimum number of colors needed to produce a non-trivial coloring of a knot. This is a knot invariant and we use the torus knots of type (2, n) as our case study. We calculate the minima in some cases. In other cases we estimate upper bounds for these minima leaning on …

We compute q-holonomic formulas for the HOMFLY polynomials of 2-bridge links colored with one-column (or one-row) Young diagrams.

We inductively define layers of colorings of knot and knotted surface diagrams using ternary quasigroups. Homological invariants from such systems of colorings use shorter differentials and of higher degree than the standard homology differentials, and give access to typically more complex homology groups.

We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a $q$-holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an $(a,q)$ super-polynomial of knots in 3-space, as was conjectured by string theorists. …

Every cubic graph is a bridge trisection's 1-skeleton for a knotted surface.

New deformation of link homology for colored diagrams.

Involutory Hopf group-coalgebras provide new invariants for 4-manifold bundles.