Related papers: Link colorings and the Goeritz matrix
The Goeritz matrix of a link is obtained from the Jacobian matrix of a modified Dehn presentation associated to a diagram using Fox's free differential calculus. When the diagram is special the Seifert matrix can also be determined from the…
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…
Extending theorems of J. E. Greene [Invent. Math. 192 (2013), 717-750] and A. S. Lipson [Enseign. Math. (2) 36 (1990), 93-114], we prove that the equivalence class of a classical link L under mutation is determined by Goeritz matrices…
Associated to a knot diagram, Goeritz introduced an integral matrix, which is now called a Goeritz matrix. It was shown by Traldi that the solution space of the equations with Goeritz matrix (precisely, unreduced Goeritz matrix called in…
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
The Wiener index of a vertex coloring of a graph is defined to be the sum of all pairwise geodesic distances between vertices of the same color. We provide characterizations of vertex colorings of paths and cycles whose Wiener index is as…
A theory about the implication structure in graph coloring is presented. Discovering hidden relations is a crucial activity in every scientific discipline. The development of mathematical models to study and discover such hidden relations…
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…
We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard…
We introduce colorings of oriented surface-links by biquasiles using marked graph diagrams. We use these colorings to define counting invariants and Boltzmann enhancements of the biquasile counting invariants for oriented surface-links. We…
In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are…
Knot Theory is currently a very broad field. Even a long survey can only cover a narrow area. Here we concentrate on the path from Goeritz matrices to quasi-alternating links. On the way, we often stray from the main road and tell related…
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…
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…
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…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
The relationship between linear relations and matrix pencils is investigated. Given a linear relation, we introduce its Weyr characteristic. If the linear relation is the range (or the kernel) representation of a given matrix pencil, we…
A linear coloring of a graph is a proper coloring of the vertices of the graph so that each pair of color classes induce a union of disjoint paths. In this paper, we prove that for every connected graph with maximum degree at most three and…
Every link diagram can be represented as a signed ribbon graph. However, different link diagrams can be represented by the same ribbon graphs. We determine how checkerboard colourable diagrams of links in real projective space, and virtual…
More than ten years ago in 2008, a new kind of graph coloring appeared in graph theory, which is the {\it rainbow connection coloring} of graphs, and then followed by some other new concepts of graph colorings, such as {\it proper…