Abstract
We present new computations of tight shapes obtained using the constrained gradient descent code RIDGERUNNER for 544 composite knots with 12 and fewer crossings, expanding our dataset to 943 knots and links. We use the new data set to analyze two outstanding conjectures about tight knots, namely that the ropelengths of composite knots are at least 4π-4 less than the sums of the prime factors and that the writhes of composite knots are the sums of the writhes of the prime factors.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.