2000 character limit reached
$\mathcal{N}=1$ Super Topological Recursion
Published 26 Jul 2020 in math-ph, hep-th, and math.MP | (2007.13186v2)
Abstract: We introduce the notion of $\mathcal{N}=1$ abstract super loop equations, and provide two equivalent ways of solving them. The first approach is a recursive formalism that can be thought of as a supersymmetric generalization of the Eynard-Orantin topological recursion, based on the geometry of a local super spectral curve. The second approach is based on the framework of super Airy structures. The resulting recursive formalism can be applied to compute correlation functions for a variety of examples related to 2d supergarvity.
Sponsor
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.