Mixed-structure compactification conjecture for rank-two Hitchin and maximal components

Let SS be a surface and let GG be a real Lie group of rank 22. A (a+,k)(\overline{\mathfrak{a}^{+}},k)-mixed structure on SS is the structure whose dual (a,W)(\mathfrak{a},W)-complex has a one-dimensional part given by trees dual to the laminar part and a two-dimensional part with a 1/k1/k-translation-surface structure, where a+\overline{\mathfrak{a}^{+}} is a Cartan subalgebra of the Lie algebra of GG and kk depends on GG. For a divergent sequence of Hitchin or maximal representations, the rescaled equivariant minimal surfaces should converge to a subcomplex of the corresponding Euclidean building. Mixed-structure compactification conjecture. The limiting complex Σ\Sigma_{\infty} is dual to a (a+,k)(\overline{\mathfrak{a}^{+}},k)-mixed structure. More precisely, if GG is a real split semisimple Lie group of rank 22, then the boundary of Hit(S,G)\mathrm{Hit}(S,G) can be identified with the space of projective classes of such mixed structures, with (a,k)=(A2,3)(\mathfrak{a},k)=(A_{2},3) for SL(3,R)\mathrm{SL}(3,\mathbb{R}), (B2,4)(B_{2},4) for Sp(4,R)\mathrm{Sp}(4,\mathbb{R}), and (G2,6)(G_{2},6) for G2RG_{2}^{\mathbb{R}}. If GG is a real semisimple Lie group of Hermitian type and rank 22, then the boundary of Max(S,G)\mathrm{Max}(S,G) can be identified with that space, with (a,k)=(A1×A1,2)(\mathfrak{a},k)=(A_{1}\times A_{1},2) for SL(2,R)×SL(2,R)\mathrm{SL}(2,\mathbb{R})\times\mathrm{SL}(2,\mathbb{R}) and (B2,4)(B_{2},4) for SO(2,n)\mathrm{SO}(2,n) with n3n\geq 3. The conjecture proposes a geometric description of the boundary of these character-variety components through limiting minimal surfaces in Euclidean buildings; its general resolution is not established in the supplied text.

Sources & referencesView supporting material

Primary source

Giuseppe Martone, Charles Ouyang and Andrea Tamburelli, “A closed ball compactification of a maximal component via cores of trees”, arXiv:2110.06106 (2021).

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.