2022
DOI: 10.1017/fms.2021.78
|View full text |Cite
|
Sign up to set email alerts
|

Gromov–Witten theory with maximal contacts

Abstract: We propose an intersection-theoretic method to reduce questions in genus 0 logarithmic Gromov–Witten theory to questions in the Gromov–Witten theory of smooth pairs, in the presence of positivity. The method is applied to the enumerative geometry of rational curves with maximal contact orders along a simple normal crossings divisor and to recent questions about its relationship to local curve counting. Three results are established. We produce counterexamples to the local-logarithmic conjectures of van Garrel–… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
27
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(27 citation statements)
references
References 24 publications
(48 reference statements)
0
27
0
Order By: Relevance
“…We thank Makoto Miura for a discussion on Hibi varieties. Finally, it is a pleasure to thank Navid Nabijou and Dhruv Ranganathan for discussions on their parallel work [26].…”
Section: A C K N O W L E D G E M E N T Smentioning
confidence: 99%
See 3 more Smart Citations
“…We thank Makoto Miura for a discussion on Hibi varieties. Finally, it is a pleasure to thank Navid Nabijou and Dhruv Ranganathan for discussions on their parallel work [26].…”
Section: A C K N O W L E D G E M E N T Smentioning
confidence: 99%
“…Relation to [26] and [7,8] After this paper was finished, we received the manuscript [26] where the log-local principle is considered for simple normal crossings divisors. The respective strategies have different flavours in the proof and complementary virtues in the outcome: [26] consider the log/local correspondence for 𝑋 smooth and 𝐷 𝑗 a hyperplane section, with a beautiful geometric argument reducing the simple normal crossings case to the case of smooth pairs, and with no restrictions on 𝑋.…”
mentioning
confidence: 99%
See 2 more Smart Citations
“…It is discussed in [CMR17] that M(x) may be obtained as an iterated blow-up of M 0,n . The results in [NR22] suggest that in the case M(x) = M n , this sequence of blow-ups can be given an explicit algorithmic description. Conjecture 4.1 suggests that the complexity of this iterated blow-up increases dramatically with n. 4.4.…”
Section: Further Directionsmentioning
confidence: 95%