Endpoint Tangents and a New Universal Lower Bound for the Ropelength of Nontrivial Knots

Preprint; not peer reviewed. This work sharpens the optimized universal diameter-normalized ropelength bound of Denne, Diao and Sullivan. Obstacle tangent cones, endpoint deficits, circular-turn comparisons, two-moving-point constraints, evolving-polar recovery, and a common-continuation estimate produce an auxiliary joint functional. Directed interval certificates prove 0.09548 <= Delta* < 0.095675 and hence Rop(K) > 15.75608926 for every nontrivial knot K. Version 5.0.0 includes frozen verifier source, manifests, local-support evidence, the complete global-cover receipt, an independent source/receipt audit with bounded fresh arithmetic, and a neutral archival preprint.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-13
DOI
https://doi.org/10.5281/zenodo.22736870
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Endpoint Tangents and a New Universal Lower Bound for the Ropelength of Nontrivial Knots

Andrew A. Schoen
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
preprint

Endpoint Tangents and a New Universal Lower Bound for the Ropelength of Nontrivial Knots

Andrew A. Schoen
preprint en

Abstract

Preprint; not peer reviewed. This work sharpens the optimized universal diameter-normalized ropelength bound of Denne, Diao and Sullivan. Obstacle tangent cones, endpoint deficits, circular-turn comparisons, two-moving-point constraints, evolving-polar recovery, and a common-continuation estimate produce an auxiliary joint functional. Directed interval certificates prove 0.09548 <= Delta* < 0.095675 and hence Rop(K) > 15.75608926 for every nontrivial knot K. Version 5.0.0 includes frozen verifier source, manifests, local-support evidence, the complete global-cover receipt, an independent source/receipt audit with bounded fresh arithmetic, and a neutral archival preprint.

Zenodo (CERN European Organization for Nuclear Research)
Association for Language Learning (GB)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.