ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SS be a surface with complexity ξ(S)\xi(S), let kk be an integer, and let α\alpha and β\beta be simple closed curves on SS. Write dCd_{\mathcal{C}} for curve graph distance and i(α,β)i(\alpha,\beta) for geometric intersection number. Polynomial intersection conjecture. For each kk, there exists a polynomial fk:N→Nf_k:\mathbb{N}\to\mathbb{N} of degree k−2k-2 such that

dC(α,β)≥k⇒i(α,β)≥fk(ξ(S)).d_{\mathcal{C}}(\alpha,\beta)\geq k \Rightarrow i(\alpha,\beta)\geq f_k(\xi(S)).

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 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.