Ribbon number additivity under connected sum

Let K1K_1 and K2K_2 be ribbon knots, and let r(K)r(K) denote the minimum ribbon number of a ribbon disk for KK. Ribbon number additivity conjecture. If K1K_1 and K2K_2 are ribbon knots, then

r(K1#K2)=r(K1)+r(K2).r(K_1 \# K_2)=r(K_1)+r(K_2).

The subadditivity inequality is immediate by taking the connected sum of minimizing ribbon disks, but equality is unknown in general. The conjecture is known when g(Ki)=r(Ki)g(K_i)=r(K_i) for both knots, including the examples Tp,q#Tp,qT_{p,q}\#\overline{T_{p,q}} discussed in the paper.

Sources & referencesView supporting material

Primary source

Stefan Friedl, Filip Misev and Alexander Zupan, “Bounding the ribbon numbers of knots and links”, arXiv:2408.11618 (2024).

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.