The factorial growth of topological recursion (Q6951665)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8071058
Language Label Description Also known as
default for all languages
No label defined
    English
    The factorial growth of topological recursion
    scientific article; zbMATH DE number 8071058

      Statements

      The factorial growth of topological recursion (English)
      0 references
      0 references
      0 references
      0 references
      29 July 2025
      0 references
      This paper deals with some problems related to the factorial growth of topological recursion formalism. This formalism provides a recursion based on \(2g-2+n\), equivalent to a set of Virasoro constraints for the quantities of interest where \(n\) is the number of boundaries or marked points. The initial data and recursion coefficients are determined by the spectral curve. The authors show that the \(n\)-point, genus-\(g\) correlation functions of topological recursion on any regular spectral curve with simple ramifications grow at most like (\(2g-2+n\))! as \(g\rightarrow\infty\), which is the expected growth rate. This provides, in particular, an upper bound for many curve counting problems in large genus and serves as a preliminary step for a resurgence analysis. This work consists of the following basic parts: 1) Introduction; 2) Topological recursion: correlators and amplitudes; 3) Comparing Airy structures and amplitudes; 4) Intersection theory; 5) Proof of the main theorems; 6) Examples of applications.
      0 references
      0 references
      topological recursion
      0 references
      correlators
      0 references
      amplitudes
      0 references
      Airy structures
      0 references
      intersection theory
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references