Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.03350

Finite Knot Theory via Ropelength-Filtered Reidemeister Graphs

Makoto Ozawa
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop a finite-recognition framework for knot types using ropelength-filtered Reidemeister graphs. For a fixed projection direction, bounded-ropelength thick-knot spaces determine a lifted Reidemeister multigraph and a monotone diagram-image filtration in the classical Reidemeister multigraph. Finite decorated neighborhoods in this filtration serve as recognition certificates. We prove that every finite Reidemeister submultigraph becomes visible at a finite ropelength level, with a computable universal bound in terms of crossing complexity. Consequently, every knot type has finite recognition length, up to mirroring. We also characterize when a finite pattern admits a vertex-coherent geometric lifting by a finite face-consistency condition; this includes tree-shaped patterns and separated cube systems. For strict ropelength sublevels, a relative parametric smoothing theorem with uniform reach control, together with multijet transversality, yields component reconstruction by Reidemeister movies. Passing to arbitrarily small right relaxations recovers the geometric merge scales exactly. Thus the principal finite-recognition and merge-scale results do not require a global projection--Cerf tameness hypothesis.

Explore related subjects

math.GTmath.MG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Makoto Ozawa. 2026-07-12. Finite Knot Theory via Ropelength-Filtered Reidemeister Graphs. https://arxiv.org/abs/2605.03350

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↗