Parallel crossing number conjecture for knots and links

Let LL be any knot or link. Let PC(L)\operatorname{PC}(L) denote its parallel overcrossing number and Cr(L)\operatorname{Cr}(L) its crossing number.

Parallel crossing number conjecture.

PC(L)=Cr(L).\operatorname{PC}(L)=\operatorname{Cr}(L).

This is presented as a weaker consequence of the conjecture that the asymptotic crossing number equals the crossing number. The paper does not report a proof, and the equality would improve its ropelength estimates.

Sources & referencesView supporting material

Primary source

Jason Cantarella, Rob Kusner and John M Sullivan, “On the Minimum Ropelength of Knots and Links”, arXiv:math/0103224 (2002).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.