Related papers: Chromatic Polynomial, Colered Jones Function and q…
Our goal is to compute the minimal-order recurrence of the colored Jones polynomial of the 7_4 knot, as well as for the first four double twist knots. As a corollary, we verify the AJ Conjecture for the simplest knot 7_4 with reducible…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
Chromatic derivatives and series expansions of bandlimited functions have recently been introduced in signal processing and they have been shown to be useful in practical applications. We extend the notion of chromatic derivative using…
Recently, big data techniques such as machine learning and topological data analysis have made their way to theoretical mathematics. Motivated by the recent work with polynomial invariants for knots, we use manifold learning and topological…
This paper presents the basic properties of chromatic derivatives and chromatic expansions and provides an appropriate motivation for introducing these notions. Chromatic derivatives are special, numerically robust linear differential…
Stanley defined the chromatic symmetric function of a graph, and Shareshian and Wachs introduced a refinement, namely the chromatic quasisymmetric function of a labeled graph. In this paper, we define the chromatic quasisymmetric function…
A generalization of the volume conjecture relates the asymptotic behavior of the colored Jones polynomial of a knot to the Chern--Simons invariant and the Reidemeister torsion of the knot complement associated with a representation of the…
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…
We define the Cartesian, Categorical, and Lexicographic, and Strong products of quantum graphs. We provide bounds on the quantum chromatic number of these products in terms of the quantum chromatic number of the factors. To adequately…
We introduce three spectral sequences which give some expressions of colored Jones polynomials. Each spectral sequence contains a Khovanov-type homology groups. Two of them are derived from a bicomplex of the colored Jones polynomial. The…
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…
The fractional and circular chromatic numbers are the two most studied non-integral refinements of the chromatic number of a graph. Starting from the definition of a coloring base of a graph, which originated in work related to ergodic…
The Conway potential function (CPF) for colored links is a convenient version of the multi-variable Alexander-Conway polynomial. We give a skein characterization of CPF, much simpler than the one by Murakami. In particular, Conway's…
Coloring numbers are one of the simplest combinatorial invariants of knots and links to describe. And with Joyce's introduction of quandles, we can understand them more algebraically. But can we extend these invariants to tangles -- knots…
If we fix a spanning subgraph $H$ of a graph $G$, we can define a chromatic number of $H$ with respect to $G$ and we show that it coincides with the chromatic number of a double covering of $G$ with co-support $H$. We also find a few…
Using the vertex model approach for braid representations, we compute polynomials for spin-1 placed on hyperbolic knots up to 15 crossings. These polynomials are referred to as 3-colored Jones polynomials or adjoint Jones polynomials.…
Given a graph G (or more generally a matroid embedded in a projective space), we construct a sequence of varieties whose geometry encodes combinatorial information about G. For example, the chromatic polynomial of G (giving at each m>0 the…
We point out that the strong slope conjecture implies that the degrees of the colored Jones knot polynomials detect the figure eight knot. Furthermore, we propose a characterization of alternating knots in terms of the Jones period and the…
A proper vertex colouring of a graph is \emph{nested} if the vertices of each of its colour classes can be ordered by inclusion of their open neighbourhoods. Through a relation to partially ordered sets, we show that the nested chromatic…
The pioneering work of Jones and Kauffman unveiled a fruitful relationship between statistical mechanics and knot theory. Recently, Jones introduced two subgroups $\vec{F}$ and $\vec{T}$ of the Thompson groups $F$ and $T$, respectively,…