Gross–Hacking–Keel mirror construction conjecture for maximal intersection log Calabi–Yau pairs

Let (Y,DY)(Y,D_Y) be a simple normal crossings maximal intersection Calabi–Yau pair such that DYD_Y supports an ample divisor. Set U=YDYU=Y\setminus D_Y, let R=k[Pic(Y)×]R=k[\mathrm{Pic}(Y)^\times] and let Ω\Omega be the canonical volume form on UU. Define

Utrop(Z)={divisorial valuations v ⁣:k(U){0}Z with v(Ω)<0}{0}.U^{\mathrm{trop}}(\mathbb Z)=\Big\{\text{divisorial valuations }v\colon k(U)\setminus\{0\}\to\mathbb Z\text{ with }v(\Omega)<0\Big\}\cup\{0\}.

Let K=Ker{Pic(Y)Pic(U)}K=\mathrm{Ker}\{\mathrm{Pic}(Y)\to\mathrm{Pic}(U)\}.

Gross–Hacking–Keel mirror construction conjecture. The free RR-module VV with basis Utrop(Z)U^{\mathrm{trop}}(\mathbb Z) has a natural finitely generated RR-algebra structure whose structure constants are non-negative integers determined by counts of rational curves on UU. The fibration

p ⁣:Spec(V)Spec(R)=TPic(Y)p\colon\operatorname{Spec}(V)\to\operatorname{Spec}(R)=T_{\mathrm{Pic}(Y)}

is a TKT_K-equivariant flat family of affine maximal intersection log Calabi–Yau varieties, and the quotient

Spec(V)/TKTPic(U)\operatorname{Spec}(V)/T_K\to T_{\mathrm{Pic}(U)}

only depends on UU and is the mirror family of UU.

This conjectural construction extends mirror symmetry from Calabi–Yau varieties to maximal intersection log Calabi–Yau pairs. It is motivated by the role of toric models and toric degenerations in known mirror constructions; the source presents the characterization of pairs admitting toric models as an open and difficult problem.

Sources & referencesView supporting material

Primary source

Anne-Sophie Kaloghiros, “Some examples of Calabi-Yau pairs with maximal intersection and no toric model”, arXiv:1812.11296 (2018).

Additional references

2 papers in this index state this conjecture (2013–2018). The statement above is taken from the most recent of them; the others are arXiv:1309.2573.

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.