Defines swept-area pseudometrics on ropelength-filtered knot spaces, proves non-degeneracy on polygonal strata, exact distances for concentric unknots and ellipses, and rigidity of the ideal unknot.
The Ideal Stratum and Deformation Persistence of Knot Types
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
We introduce a deformation-persistence framework for knot types based on normalized spaces of representatives. For a knot type K and a parameter Lambda >= 0, let Y_Lambda(K) be the space of representatives with thickness at least 1 and length at most Lambda, modulo reparametrization and orientation-preserving Euclidean isometries. Admissible deformations are paths staying inside some Y_Lambda(K), and their path components define admissible components. The first nonempty level occurs at the ropelength Rop(K), and the corresponding minimizer locus is called the ideal stratum. We define ideal admissible components, their number, and ideal merge scales, which record when distinct ideal components become admissibly connected as the length bound is relaxed. These merge scales induce a finite-valued ultrapseudometric on the set of ideal components. We then construct the associated pure merge Vietoris--Rips filtration, a simplicial encoding of the zero-dimensional merge persistence. Finally, we discuss finite-dimensional polygonal approximations as a computational model for constrained knot-shape spaces.
fields
math.GT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Defines finite recognition lengths for knots using ropelength-filtered lifted Reidemeister graphs and characteristic patterns derived from the Barbensi-Celoria reconstruction theorem.
citing papers explorer
-
Swept-Area Pseudometrics on Ropelength-Filtered Knot Spaces
Defines swept-area pseudometrics on ropelength-filtered knot spaces, proves non-degeneracy on polygonal strata, exact distances for concentric unknots and ellipses, and rigidity of the ideal unknot.
-
Finite Knot Theory via Ropelength-Filtered Reidemeister Graphs
Defines finite recognition lengths for knots using ropelength-filtered lifted Reidemeister graphs and characteristic patterns derived from the Barbensi-Celoria reconstruction theorem.