Related papers: On the Potential Function of the Colored Jones Pol…
We show that for a torus knot the SL(2;C) Chern-Simons invariants and the SL(2;C) twisted Reidemeister torsions appear in an asymptotic expansion of the colored Jones polynomial. This suggests a generalization of the volume conjecture that…
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components.…
The chromatic polynomial of a graph G counts the number of proper colorings of G. We give an affirmative answer to the conjecture of Read and Rota-Heron-Welsh that the absolute values of the coefficients of the chromatic polynomial form a…
We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
We connect two important conjectures in the theory of knot polynomials. The first one is the property Al_R(q) = Al_{[1]}(q^{|R|}) for all single hook Young diagrams R, which is known to hold for all knots. The second conjecture claims that…
A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.
In this paper, we study the asymptotic behavior of the colored Jones polynomials evaluated at roots of unity for a special class of knots. We show that certain limit is zero as predicted by the volume conjecture.
In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…
This paper will be an exposition of the Kauffman bracket polynomial model of the Jones polynomial, tangle methods for computing the Jones polynomial, and the use of these methods to produce non-trivial links that cannot be detected by the…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
We obtain a measure theoretical characterization of polynomials among rational functions on $\mathbb{P}^1$, which generalizes a theorem of Lopes. Our proof applies both classical and dynamically weighted potential theory.
We construct $S^r$-colored knot Floer homologies and prove that they satisfy categorified recurrence relations. The associated Euler characteristic implies $q$-holonomicity of the corresponding sequence of colored Alexander polynomials, in…
For one-matrix models with polynomial potentials, the explicit relationship between the partition function and the isomonodromic tau function for the 2x2 polynomial differential systems satisfied by the associated orthogonal polynomials is…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
Link/knot invariants are series with integer coefficients, and it is a long-standing problem to get them positive and possessing cohomological interpretation. Constructing positive "superpolynomials" is not straightforward, especially for…