The tropical web-function conjecture for four flags

Let nn be a positive integer and let a,b,c,da,b,c,d satisfy 1a,b,c,d<n1\leq a,b,c,d<n, a+b>na+b>n, and a+b+c+d=2na+b+c+d=2n. Let FF be the cluster-algebra function on Conf4ASLn\operatorname{Conf}_4 \mathcal{A}_{SL_n} constructed from the corresponding invariant web, and let FtF^t denote its tropicalization. For points x1,x2,x3,x4x_1,x_2,x_3,x_4 in the affine building for PGLnPGL_n, write dkd_k for the corresponding distance function indexed by kk. The tropical web-function conjecture. Ft(x1,x2,x3,x4)F^t(x_1,x_2,x_3,x_4) is given by the minimum, over points pp and qq in the affine building for PGLnPGL_n, of

da(p,x1)+db(p,x2)+da+bn(q,p)+dc(q,x3)+dd(q,x4).d_a(p,x_1)+d_b(p,x_2)+d_{a+b-n}(q,p)+d_c(q,x_3)+d_d(q,x_4).

This extends the paper's higher-lamination intersection framework to a cluster function arising from a web beyond the results established in the paper. The parser supplies no evidence that the statement has been proved or refuted, so its status remains open.

Sources & referencesView supporting material

Primary source

Ian Le, “Intersection Pairings for Higher Laminations”, arXiv:1708.00780 (2017).

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.