2000 character limit reached
Graph sums in the Remodeling Conjecture
Published 11 Feb 2019 in math.AG | (1902.03697v1)
Abstract: The BKMP Remodeling Conjecture \cite{Ma,BKMP09,BKMP10} predicts all genus open-closed Gromov-Witten invariants for a toric Calabi-Yau $3$-orbifold by Eynard-Orantin's topological recursion \cite{EO07} on its mirror curve. The proof of the Remodeling Conjecture by the authors \cite{FLZ1,FLZ3} relies on comparing two Feynman-type graph sums in both A and B-models. In this paper, we will survey these graph sum formulae and discuss their roles in the proof of the conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.