ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer and let a,b,c,da,b,c,d satisfy 1≤a,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 Conf⁡4ASLn\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+b−n(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.

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.