Schleimer's distance formula conjecture for multiarc and curve graphs

Let Σ\Sigma be a compact, connected, orientable surface, and let A\mathcal A be a multiarc and curve graph on Σ\Sigma. For a witness WW, let πW:A2CW{}\pi_W:\mathcal A\to 2^{\mathcal C W}\setminus\{\varnothing\} be subsurface projection and define

dW(a,b)=diamCW(πW(a)πW(b)).d_W(a,b)=\operatorname{diam}_{\mathcal C W}(\pi_W(a)\cup\pi_W(b)).

Let X\mathscr X denote the collection of witnesses of A\mathcal A, let [x]C[x]_C denote the thresholded quantity used in the distance formula, and write dA(a,b)=K,Erd_{\mathcal A}(a,b)\stackrel{K,E}{=}r when the two quantities are equivalent up to multiplicative constant KK and additive constant EE. Assume that (a,b)E(A)(a,b)\in E(\mathcal A) if and only if i(a,b)Mi(a,b)\leq M for some M0M\geq0. Schleimer's distance formula conjecture. There exists C=C(A)C'=C'(\mathcal A) such that for every C>CC>C', there are constants K,E0K,E\geq0 satisfying

dA(a,b)=K,EWX[dW(a,b)]C.d_{\mathcal A}(a,b)\stackrel{K,E}{=}\sum_{W\in\mathscr X}[d_W(a,b)]_C.

This is a proposed Masur--Minsky-style distance formula for multiarc and curve graphs. The source does not specify whether it has been proved or disproved.

Sources & referencesView supporting material

Primary source

Michael C. Kopreski, “Multiarc and curve graphs are hierarchically hyperbolic”, arXiv:2311.04356 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.