Polynomial intersection conjecture for curve graph distance
Statement
Let be a surface with complexity , let be an integer, and let and be simple closed curves on . Write for curve graph distance and for geometric intersection number. Polynomial intersection conjecture. For each , there exists a polynomial of degree such that
This would strengthen the lower bound used to obtain uniform hyperbolicity of the curve graph. The source does not provide resolution evidence, so the conjecture is recorded as open.
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.