Related papers: Link invariants, the chromatic polynomial and the …
We study relations between three interrelated notions of graph (list) coloring: single conflict coloring, adapted list coloring and choosability with separation (with $1$ overlapping color between lists of adjacent vertices), and their…
We provide a translation between Chekanov's combinatorial theory for invariants of Legendrian knots in the standard contact R^3 and a relative version of Eliashberg and Hofer's Contact Homology. We use this translation to transport the idea…
We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…
We find a combinatorial setting for the coefficients of the Boros-Moll polynomials $P_m(a)$ in terms of partially 2-colored permutations. Using this model, we give a combinatorial proof of a recurrence relation on the coefficients of…
The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones…
M. Niebrzydowski and J. H. Przytycki defined a Kauffman bracket magma and constructed the invariant P of framed links in 3-space. The invariant is closely related to the Kauffman bracket polynomial. The normalized bracket polynomial is…
This paper consists of three parts. First, we generalize the Jaeger Formula to express the Kauffman-Vogel graph polynomial as a state sum of the Murakami-Ohtsuki-Yamada graph polynomial. Then, we demonstrate that reversing the orientation…
A framework for studying knot and link invariants from any rational conformal field theory is developed. In particular, minimal models, superconformal models and $W_N$ models are studied. The invariants are related to the invariants…
R.M. Kashaev conjectured that the asymptotic behavior of his link invariant, which equals the colored Jones polynomial evaluated at a root of unity, determines the hyperbolic volume of any hyperbolic link complement. We observe numerically…
We have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…
In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big girth (the length of the shortest cycle) and large chromatic…
Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual links: the cut point number. Checkerboard framings and cut…
We show that any of the new knot invariants obtained from Chern-Simons theory based on an arbitrary non-abelian gauge group do not distinguish isotopically inequivalent mutant knots and links. In an attempt to distinguish these knots and…
The purpose of this article is to study the relationship between numerical invariants of certain subspace arrangements coming from reflection groups and numerical invariants arising in the representation theory of Cherednik algebras. For…
Alexander polynomial arises in the leading term of a semi-classical Melvin-Morton-Rozansky expansion of colored knot polynomials. In this work, following the opposite direction, we propose how to reconstruct colored HOMFLY-PT polynomials,…
The chromatic polynomial and its generalization, the chromatic symmetric function, are two important graph invariants. Celebrated theorems of Birkhoff, Whitney, and Stanley show how both objects can be expressed in three different ways: as…
An acyclic coloring of a digraph as defined by Neumann-Lara is a vertex-coloring such that no monochromatic directed cycles occur. Counting the number of such colorings with $k$ colors can be done by counting so-called Neumann-Lara-coflows…
The present paper is an introduction to a combinatorial theory arising as a natural generalisation of classical and virtual knot theory. There is a way to encode links by a class of `realisable' graphs. When passing to generic graphs with…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
We present the $CWR$ invariant, a new invariant for alternating links, which builds upon and generalizes the $WRP$ invariant. The $CWR$ invariant is an array of two-variable polynomials that provides a stronger invariant compared to the…