Cluster algebras and Jones polynomials

Kyungyong Lee; Ralf Schiffler

Home/Archive/arXiv

arXiv · 1710.08063

Cluster algebras and Jones polynomials

Kyungyong Lee·Ralf Schiffler

View original source ↗Read source document ↗Export metadata ↓

Abstract

We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by continued fractions, and it has recently been shown that one can associate to each continued fraction a snake graph, and hence a cluster variable in a cluster algebra. We show that up to normalization by the leading term the Jones polynomial of the 2-bridge link is equal to the specialization of this cluster variable obtained by setting all initial cluster variables to 1 and specializing the initial principal coefficients of the cluster algebra as follows $y_1=t^{-2}$ and $ y_i=-t^{-1}$, for all $i> 1$. As a consequence we obtain a direct formula for the Jones polynomial of a 2-bridge link as the numerator of a continued fraction of Laurent polynomials in $q=-t^{-1}$. We also obtain formulas for the degree and the width of the Jones polynomial, as well as for the first three and the last three coefficients. Along the way, we also develop some basic facts about even continued fractions and construct their snake graphs. We show that the snake graph of an even continued fraction is ismorphic to the snake graph of a positive continued fraction if the continued fractions have the same value. We also give recursive formulas for the Jones polynomials.

Explore related subjects

math.GT math.CO math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Kyungyong Lee, Ralf Schiffler. 2017-11-15. Cluster algebras and Jones polynomials. https://arxiv.org/abs/1710.08063

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

KEEP EXPLORING

Related papers

arXiv2026

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT↗

arXiv2026

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT↗

arXiv2026

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT↗