Reflection-vector conjecture for exceptional objects and collections

About 3 years old · traced to

Let XX be the variety under consideration, let Db(X)D^b(X) be its bounded derived category, and let Ψq\Psi_q assign to an object of Db(X)D^b(X) its quantum-cohomological vector. Assume that the quantum cohomology of XX has reflection vectors, denoted by R\mathcal{R}, with pairing (x∣y)(x|y) and monodromy group WW. An object of Db(X)D^b(X) is exceptional if

Ext⁡k(E,E)={Cif k=0,0otherwise,\operatorname{Ext}^k(\mathcal{E},\mathcal{E})=\begin{cases}\mathbb{C}&\text{if }k=0,\\0&\text{otherwise},\end{cases}

and a sequence of exceptional objects is a full exceptional collection if it generates Db(X)D^b(X) under isomorphisms, shifts, and cones.

Reflection-vector conjecture. (a) If the quantum cohomology of XX is convergent and semisimple, then Ψq(E)\Psi_q(\mathcal{E}) is a reflection vector for every exceptional object E∈Db(X)\mathcal{E}\in D^b(X). (b) If (E1,…,EN)(\mathcal{E}_1,\dots,\mathcal{E}_N) is a full exceptional collection in Db(X)D^b(X), then the reflection vectors αi:=Ψq(Ei)\alpha_i:=\Psi_q(\mathcal{E}_i) (1≤i≤N)(1\leq i\leq N) generate the set R\mathcal{R} of all reflection vectors in the following sense: the reflections x↦x−(x∣αi)αix\mapsto x-(x|\alpha_i)\alpha_i (1≤i≤N)(1\leq i\leq N) generate the monodromy group WW of quantum cohomology, and for every α∈R\alpha\in\mathcal{R} there exists w∈Ww\in W such that w(α)∈{α1,…,αN}w(\alpha)\in\{\alpha_1,\dots,\alpha_N\}.

This relates convergence and semisimplicity of quantum cohomology to exceptional objects and full exceptional collections in the derived category. The supplied text does not state whether the conjecture has been proved or remains open.

References

Primary source

Todor Milanov and Xiaokun Xia, “Reflection Vectors and Quantum Cohomology of Blowups”, arXiv:2304.04365 (2024).

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.