相关论文: On the Potential Function of the Colored Jones Pol…

The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…

In 2007, Dmytrenko, Lazebnik and Williford posed two related conjectures about polynomials over finite fields. Conjecture~1 is a claim about the uniqueness of certain monomial graphs. Conjecture~2, which implies Conjecture~1, deals with…

We construct a bigraded cohomology theory of links whose Euler characteristic is the Jones polynomial.

We compute the Jones polynomial for a three-parameter family of links, the twisted torus links of the form $T((p,q),(2,s))$ where $p$ and $q$ are coprime and $s$ is nonzero. When $s = 2n$, these links are the twisted torus knots…

This paper describes how many known graph polynomials arise from the coefficients of chromatic symmetric function expansions in different bases, and studies a new polynomial arising by expanding over a basis given by chromatic symmetric…

In this paper we prove the Dynamical Mordell-Lang Conjecture for polynomial endomorphisms of the affine plane.

I show various calculations of the limit of the colored Jones function for the figure-eight knot and confirm R. Kashaev's conjecture in this case.

We establish some facts about the behavior of the rational-geometric subvariety of the $SL_2(\c)$ or $PSL_2(\c)$ character variety of a hyperbolic knot manifold under the restriction map to the $SL_2(\c)$ or $PSL_2(\c)$ character variety of…

We study the asymptotic behavior of the $N$-dimensional colored Jones polynomial evaluated at $\exp(\xi/N)$ for a real number $\xi$ greater than a certain constant. We prove that, from the asymptotic behavior, we can extract the…

We give an explicit formula for the Jones polynomial of any rational link in terms of the denominators of the canonical continued fraction of the slope of the given rational link.

Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…

We study q-holonomic sequences that arise as the colored Jones polynomial of knots in 3-space. The minimal-order recurrence for such a sequence is called the (non-commutative) A-polynomial of a knot. Using the "method of guessing", we…

We formulate a conjecture about the structure of `upper lines' in the expansion of the colored Jones polynomial of a knot in powers of (q-1). The Melvin-Morton conjecture states that the bottom line in this expansion is equal to the inverse…

In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

An explicit formula for the $A$-polynomial of the knot having Conway's notation $C(2n,4)$ is computed up to repeated factors. Our polynomial contains exactly the same irreducible factors as the $A$-polynomial defined in~\cite{CCGLS1}.

Using a simple recurrence relation we give a new method to compute Jones polynomials of closed braids: we find a general expansion formula and a rational generating function for Jones polynomials. The method is used to estimate degree of…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Rosso and Jones gave a formula for the colored Jones polynomial of a torus knot, colored by an irreducible representation of a simple Lie algebra. The Rosso-Jones formula involves a plethysm function, unknown in general. We provide an…

Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…