2000 character limit reached
Topological recursion with hard edges
Published 28 Feb 2017 in math.AG, math-ph, and math.MP | (1702.08631v2)
Abstract: We prove a Givental type decomposition for partition functions that arise out of topological recursion applied to spectral curves. Copies of the Konstevich-Witten KdV tau function arise out of regular spectral curves and copies of the Brezin-Gross-Witten KdV tau function arise out of irregular spectral curves. We present the example of this decomposition for the matrix model with two hard edges and spectral curve $(x2-4)y2=1$
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.