Finite Knot Theory via Ropelength-Filtered Reidemeister Graphs
Makoto Ozawa

TL;DR
This paper introduces a finite knot theory framework using ropelength-filtered Reidemeister graphs to analyze knot types through diagram data and Reidemeister moves, providing new invariants and recognition scales.
Contribution
It develops a novel diagrammatic approach to finite knot theory based on ropelength-filtered lifted Reidemeister graphs and characteristic patterns for knot recognition.
Findings
Defined the finite recognition length $L_{char,u}(K)$ for knots.
Established the finite-local reconstruction theorem of Barbensi--Celoria.
Provided controlled models and conditional statements for full ropelength spaces.
Abstract
This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite Reidemeister data visible in generic projections. For each projection direction , we introduce the ropelength-filtered lifted Reidemeister graphs , for , recording diagram data and Reidemeister moves that lift to admissible thick deformations below the ropelength level . Using the finite-local reconstruction theorem of Barbensi--Celoria, we define characteristic Reidemeister patterns and the finite recognition length , the first ropelength scale at which a finite pattern recognizing , up to mirroring, appears in the lifted graph. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
