Unknotting number conjecture for connected sums of opposite torus knots

Let T(2,k)T(2,k) be the (2,k)(2,k)-torus link, let T(2,k)T(2,-k) be its mirror image, and let u(L)u(L) denote the unknotting number of a link LL. For an odd integer kk, consider the connected sum T(2,k)  T(2,k)T(2,k)\ \sharp\ T(2,-k). Unknotting number conjecture. For any odd integer kk,

u(T(2,k)  T(2,k))=k1.u(T(2,k)\ \sharp\ T(2,-k)) = k-1.

This conjectural formula is used to estimate the number of Reidemeister moves needed to transform the diagrams DnD_n into diagrams with no crossings. The source provides lower bounds for the relevant unknotting numbers but does not establish this formula.

Sources & referencesView supporting material

Primary source

Chuichiro Hayashi and Miwa Hayashi, “Unknotting number and number of Reidemeister moves needed for unlinking”, arXiv:1012.4131 (2010).

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.