Ribbon number additivity under connected sum
Ribbon number additivity under connected sum
Let and be ribbon knots, and let denote the minimum ribbon number of a ribbon disk for . Ribbon number additivity conjecture. If and are ribbon knots, then
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 for both knots, including the examples 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.