Search arXivSearch

arXiv · 2602.18129

Stuck Knots: Rigidity, Invariants, and Unsticking Distance

Abstract

A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and introduce new geometric features into the study of knot embeddings. In this paper we develop a topological framework for knots governed by such constraints. We model stuck crossings as locally rigid configurations in spatial embeddings, placing stuck knots in close relation to rigid spatial graph theory while preserving the classical over-under information and orientation of crossings. We formalize the corresponding notion of isotopy and introduce the {\it unstick move}, which releases rigidity and allows classical simplifications to occur. To detect rigid structure algebraically, we construct polynomial invariants for stuck knots, including a HOMFLYPT-type invariant and a state-sum model extending the Kauffman bracket. These invariants show that rigidity contributes independent information even when the underlying classical knot type remains fixed. We further introduce a {\it relaxed isotopy} framework and define the {\it unsticking distance}, a geometric measure quantifying the minimal number of rigidity constraints that must be released in order to relate two stuck knots. This perspective interprets stuck crossings as barriers to isotopy and highlights the role of constraint release in diagrammatic simplification.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ioannis Diamantis. 2026-02-20. Stuck Knots: Rigidity, Invariants, and Unsticking Distance. https://arxiv.org/abs/2602.18129

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

KEEP EXPLORING

Related papers

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

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

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