相关论文: Random walks and the colored Jones function

In this paper, a generalized version of Morton's formula is proved. Using this formula, one can write down the colored Jones polynomials of cabling of an knot in terms of the colored Jones polynomials of the original knot.

We consider a quiver structure on the set of quandle colorings of an oriented knot or link diagram. This structure contains a wealth of knot and link invariants and provides a categorification of the quandle counting invariant in the most…

In an earlier paper the first author defined a non-commutative A-polynomial for knots in 3-space, using the colored Jones function. The idea is that the colored Jones function of a knot satisfies a non-trivial linear q-difference equation.…

This paper defines versions of the Jones polynomial and Khovanov homology by using several maps from the set of Gauss diagrams to its variant. Through calculation of some examples, this paper also shows that these versions behave…

For the potential function of a link diagram induced by the optimistic limit of the colored Jones polynomial, we show the existence of a solution of the hyperbolicity equations by directly constructing it. This construction is based on the…

Random walk is one of the most classical and well-studied model in probability theory. For two correlated random walks on lattice, every step of the random walks has only two states, moving in the same direction or moving in the opposite…

We investigate coincidences of the (one-variable) Jones polynomial amongst rational knots, what we call `Jones rational coincidences'. We provide moves on the continued fraction expansion of the associated rational which we prove do not…

We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization…

Many structures in science, engineering, and art can be viewed as curves in 3-space. The entanglement of these curves plays a crucial role in determining the functionality and physical properties of materials. Many concepts in knot theory…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

We describe in this talk three methods of constructing different links with the same Jones type invariant. All three can be thought as generalizations of mutation. The first combines the satellite construction with mutation. The second uses…

We point out the connection between mathematical knot theory and spin glass/search problem. In particular, we present a statistical mechanical formulation of the problem of computing a knot invariant; p-colorability problem, which provides…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

This note is dedicated to the study of a Hopf module structures on the space of framed chord diagrams and framed graphs. We also introduce a framed version of the chromatic polynomial and propose two methods to construct framed weight…

The main result of this paper states that for a given countable system of data, there exists a countable iterated function system consisting of Rakotch contractions, such that its attractor is the graph of a fractal interpolation function…

On the plane, every random compact set with almost surely uncountable first projection intersects with a high probability the graph of some continuous function. Implication: every black noise over the plane fails to factorize when the plane…

A well-known result of Alon shows that the coloring number of a graph is bounded by a function of its choosability. We explore this relationship in a more general setting with relaxed assumptions on color classes, encoded by a graph…

The basic mathematical properties of Green's functions used in statistical mechanics as well as the equations defining these functions and the techniques of solving these equations are reviewed. An approach is presented called the…

We present an algorithm to express Wilson lines that are defined on piecewise linear paths in function of their individual segments, reducing the number of diagrams needed to be calculated. The important step lies in the observation that…