Related papers: Random walks and the colored Jones function
Garoufalidis conjectured a relation between the boundary slopes of a knot and its colored Jones polynomials. According to the conjecture, certain boundary slopes are detected by the sequence of degrees of the colored Jones polynomials. We…
We extend the notion of nonbacktracking walks from unweighted graphs to graphs whose edges have a nonnegative weight. Here the weight associated with a walk is taken to be the product over the weights along the individual edges. We give two…
The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…
Weighted counting problems are a natural generalization of counting problems where a weight is associated with every computational path of polynomial-time non-deterministic Turing machines and the goal is to compute the sum of the weights…
The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…
This monograph derives direct and concrete relations between colored Jones polynomials and the topology of incompressible spanning surfaces in knot and link complements. Under mild diagrammatic hypotheses that arise naturally in the study…
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…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
We show that the family of colored Jones polynomials of the closure of a braid compute weighted sums of abelianized Lefschetz numbers associated with the action of the braid on configuration spaces. The sum is over the number of…
We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…
This is an introduction to the Volume Conjecture and its generalizations for nonexperts. The Volume Conjecture states that a certain limit of the colored Jones polynomial of a knot would give the volume of its complement. If we deform the…
We consider random walks on edge coloured random graphs, where the colour of an edge reflects the cost of using it. In the simplest instance, the edges are coloured red or blue. Blue edges are free to use, whereas red edges incur a unit…
To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The paper is concerned with the asymptotic behavior of the value of the $n$th colored Jones polynomial at…
We discuss two realizations of the colored Jones polynomials of a knot, one from an unnoticed work of the second author in 1994 on quantum R-matrices at roots of unity obtained from solutions of the pentagon identity, and another one from…
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 introduce a new approach to universal quantum knot invariants that emphasizes generating functions instead of generators and relations. All the relevant generating functions are shown to be perturbed Gaussians of the form $Pe^G$, where…
We utilize the trip matrix method of calculating the Jones Polynomial to give an alternative proof that the Jones Polynomial is multiplicative under connect sums.
We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…
This article presents examples of an application of the finite field method for the computation of the characteristic polynomial of the matching arrangement of a graph. Weight functions on edges of a graph with weights from a finite field…
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…