Random Walk on Knot Diagrams, Colored Jones Polynomial and Ihara-Selberg Zeta Function

Xiao-Song Lin; Zhenghan Wang

Home/Archive/arXiv

arXiv · math/9812039

Random Walk on Knot Diagrams, Colored Jones Polynomial and Ihara-Selberg Zeta Function

Xiao-Song Lin·Zhenghan Wang

View original source ↗Read source document ↗Export metadata ↓

Abstract

A model of random walk on knot diagrams is used to study the Alexander polynomial and the colored Jones polynomial of knots. In this context, the inverse of the Alexander polynomial of a knot plays the role of an Ihara-Selberg zeta function of a directed weighted graph, counting with weights cycles of random walk on a 1-string link whose closure is the knot in question. The colored Jones polynomial then counts with weights families of ``self-avoiding'' cycles of random walk on the cabling of the 1-string link. As a consequence of such interpretations of the Alexander and colored Jones polynomials, the computation of the limit of the renormalized colored Jones polynomial when the coloring (or cabling) parameter tends to infinity whereas the weight parameter tends to 1 leads immediately to a new proof of the Melvin-Morton conjecture, which was first established by Rozansky and by Bar-Natan and Garoufalidis.

Explore related subjects

math.GT math.PR math.QA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Xiao-Song Lin, Zhenghan Wang. 1998-12-07. Random Walk on Knot Diagrams, Colored Jones Polynomial and Ihara-Selberg Zeta Function. https://arxiv.org/abs/math/9812039

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Hyperbolic links associated to Hamiltonian subgraphs in simple $3$-polytopes

We build a large family of hyperbolic links with an explicit decomposition of the complement into right-angled hyperbolic polytopes of finite volume. Namely, in a series of papers A.D.Mednykn and A.Yu.Vesnin introduced a construction that for a given right-angled polytope $P$ in geometry $\mathbb L^3$, $\mathbb R^3$, $\mathbb S^3$, $\mathbb L^2\times \mathbb R$, $\mathbb S^2\times \mathbb R$ and a Hamiltonian cycle, theta-subgraph or $K_4$-subgraph $Γ$ in the $1$-skeleton of $P$ builds a geometric $3$-manifold $N(P,Γ)$ with an involution $τ$ such that $N(P,Γ)/\langleτ\rangle\simeq S^3$. The brach set of the corresponding $2$-sheeted branched covering $N(P,Γ)\to S^3$ is a link $C_Γ\subset S^3$ consisting of trivially embedded circles. This construction reformulated in the language of toric topology works for such a subgraph $Γ$ in any simple $3$-polytope $P$ and gives a topological $3$-manifold $N(P,Γ)$. We give a criterion when $S^3\setminus C_Γ$ has a complete hyperbolic structure of finite volume and generalize this criterion to similar links in $3$-manifolds different from $S^3$. We prove that hyperbolic links $C_Γ$ are parametrized by nonselfcrossing Eulerian cycles, Eulerian theta-subgraphs and Eulerian $K_4$-subgraphs in hyperbolic right-angled $3$-polytopes of finite volume in $\mathbb L^3$ with $0$, $2$ or $4$ finite vertices. The complement $S^3\setminus C_Γ$ is glued of $4$, $8$ or $16$ copies of the corresponding right-angled polytope. We give a criterion when the link $C_Γ$ consists of mutually unlinked circles and prove that if such a link is nontrivial, then it contains the Borromean rings. The latter problem is motivated by the Efimov effect in quantum mechanics.

math.GT↗

arXiv2026

Knots and the Sierpinski Tetrahedron

In this paper we prove that there are infinitely many knots that cannot be embedded in the 1-skeletons of the finite iterations of the Sierpinski tetrahedron fractal. We do this by proving that such an embedding induces a sphere decomposition of weight at most 6. There are infinitely many knots with spherewidth greater than this.