For folded ribbon knots and links, can one prove lower bounds for folded ribbonlength; can one find embeddings with Rib(K_w)\leq O(Cr(K)^p) for some 1\leq p<3/2 or families…
Statement
For folded ribbon knots and links, can one prove lower bounds for folded ribbonlength; can one find embeddings with Rib(K_w)\leq O(Cr(K)^p) for some 1\leq p<3/2 or families with superlinear folded ribbonlength in crossing number; and how does folded ribbonlength depend on ribbon equivalence and framing?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.