ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (X,comega)(X,comega) be a closed monotone symplectic manifold of dimension 2n2n, with [comega]=c1(X)[comega]=c_1(X). Let tt be a formal variable of degree 22, and let

∇∂∂tQH:=∂∂t+μt−c1⋆t2\nabla^{QH}_{\frac{\partial}{\partial t}}:=\frac{\partial}{\partial t}+\frac{\mu}{t}-\frac{c_1\star}{t^2}

be the quantum tt-connection on H∗(X;C)[[t]]H^*(X;\mathbb{C})[[t]], where μ∣Hk(X)=k−n2\mu|_{H^k(X)}=\frac{k-n}{2} and ⋆\star is the small quantum cup product. The exponential type conjecture. The quantum tt-connection (H∗(X;C)((t)),∇∂∂tQH)(H^*(X;\mathbb{C})((t)),\nabla^{QH}_{\frac{\partial}{\partial t}}) admits a finite direct sum decomposition

∇∂∂tQH=⨁λ(C((t)),∂∂t−λt2)⊗∇∂∂treg,λ,\nabla^{QH}_{\frac{\partial}{\partial t}}=\bigoplus_{\lambda}(\mathbb{C}((t)),\frac{\partial}{\partial t}-\frac{\lambda}{t^2})\otimes \nabla^{reg,\lambda}_{\frac{\partial}{\partial t}},

where λ∈C\lambda\in\mathbb{C} and each ∇∂∂treg,λ\nabla^{reg,\lambda}_{\frac{\partial}{\partial t}} is gauge equivalent to a connection with simple poles at t=0t=0 and monodromies given by roots of unity. Equivalently, the quantum connection has unramified exponential type and quasi-unipotent regularized monodromy. This conjecture concerns the singularity and monodromy structure of quantum connections; the source paper proves it for closed monotone symplectic manifolds, while the general conjecture is attributed to Katzarkov–Kontsevich–Pantev and Galkin–Golyshev–Iritani.

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.