ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL be a link. Its ball number ball(L)\mathsf{ball}(L) is the minimum number of non-overlapping solid balls needed in a necklace representation of LL, and its crossing number cr(L)\mathsf{cr}(L) is the minimum crossing number among diagrams of LL.

Improved ball-number conjecture. For every link LL,

ball(L)≤4cr(L).\mathsf{ball}(L)\leq 4\mathsf{cr}(L).

Moreover, equality holds if LL is alternating.

The paper proves the weaker upper bound ball(L)≤5cr(L)\mathsf{ball}(L)\leq 5\mathsf{cr}(L) and presents an explicit construction of necklace representations. The proposed improvement to 4cr(L)4\mathsf{cr}(L), 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.