Defines finite recognition lengths for knots using ropelength-filtered lifted Reidemeister graphs and characteristic patterns derived from the Barbensi-Celoria reconstruction theorem.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.