Sublinear improvement conjecture for the three-page index
Statement
Let be a non-split link, let denote its crossing number, and let denote its three-page index. Sublinear improvement conjecture. There exists a constant such that, for every non-split link ,
The conjecture would improve the known linear upper bound by reducing its asymptotic coefficient; the source describes the graph-theoretic approach as requiring further technical development and gives no resolution.
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.