The improved ball-number bound for links
Statement
Let be a link. Its ball number is the minimum number of non-overlapping solid balls needed in a necklace representation of , and its crossing number is the minimum crossing number among diagrams of .
Improved ball-number conjecture. For every link ,
Moreover, equality holds if is alternating.
The paper proves the weaker upper bound and presents an explicit construction of necklace representations. The proposed improvement to , together with the alternating-link equality statement, is not resolved in the supplied text.
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.