EUVIMEDEUVIMED entdecken
Crossref

Gromov–Witten theory beyond maximal contacts

Yu Wang, Fenglong You

Journal of Algebraic Geometry · 20.05.2026 · 35 (4) · 741-782

DOI: 10.1090/jag/863 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Algebraic Geometry, online erschienen am 20.05.2026. Verfasst von Yu Wang und 1 weiteren Autor:innen. Die Arbeit nennt 47 Literaturangaben. Gefördert von: European Research Council, European Commission, FP7 Ideas: European Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Given a smooth projective variety X X and a smooth nef divisor D D , we identify genus zero relative Gromov–Witten invariants of ( X , D ) (X,D) with ( n + 1 ) (n+1) relative markings with genus zero orbifold Gromov–Witten invariants of multi-root stacks over the P 1 \mathbb {P}^{1} -bundle P ≔ P ( O X ( − D ) ⊕ O X ) P ≔\mathbb {P}(\mathcal {O}_{X}(-D)\oplus \mathcal {O}_{X}) with n n orbifold markings. This is a generalization of the local-relative correspondence beyond maximal contacts. Repeating this process, we identify genus zero relative Gromov–Witten invariants of ambient insertions with genus zero absolute Gromov–Witten invariants of toric bundles. We also present how this correspondence can be used to compute genus zero two-point relative Gromov–Witten invariants.

Förderung

  • European Research Council
  • European Commission
  • FP7 Ideas: European Research Council

Zitieren

APA

Wang, Y., & You, F. (2026). Gromov–Witten theory beyond maximal contacts. Journal of Algebraic Geometry, 35(4), 741-782. https://doi.org/10.1090/jag/863

Vancouver

Wang Y, You F. Gromov–Witten theory beyond maximal contacts. Journal of Algebraic Geometry. 2026;35(4):741-782. doi:10.1090/jag/863

BibTeX
@article{Wang2026,
  author = {Wang, Yu and You, Fenglong},
  title = {Gromov–Witten theory beyond maximal contacts},
  journal = {Journal of Algebraic Geometry},
  year = {2026},
  volume = {35},
  number = {4},
  pages = {741--782},
  doi = {10.1090/jag/863}
}
Kostenlos starten →