MétaCan
Menu
Back to cohort
Record W4393950498 · doi:10.1090/memo/1476

Higher Airy Structures, 𝒲 Algebras and Topological Recursion

2024· article· en· W4393950498 on OpenAlexafffund
Gaëtan Borot, Vincent Bouchard, Nitin Kumar Chidambaram, Thomas Creutzig, Dmitry Noshchenko

Bibliographic record

VenueMemoirs of the American Mathematical Society · 2024
Typearticle
Languageen
FieldMathematics
TopicAlgebraic structures and combinatorial models
Canadian institutionsUniversity of Alberta
FundersEuropean Regional Development FundNatural Sciences and Engineering Research Council of CanadaMax-Planck-GesellschaftFundacja na rzecz Nauki PolskiejEuropean Commission
KeywordsRecursion (computer science)MathematicsPure mathematicsAlgebra over a fieldTopology (electrical circuits)CombinatoricsAlgorithm

Abstract

fetched live from OpenAlex

We define higher quantum Airy structures as generalizations of the Kontsevich–Soibelman quantum Airy structures by allowing differential operators of arbitrary order (instead of only quadratic). We construct many classes of examples of higher quantum Airy structures as modules of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper W left-parenthesis German g right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">W</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">g</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {W}(\mathfrak {g})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> algebras at self-dual level, with <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="German g equals German g German l Subscript upper N plus 1"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">g</mml:mi> </mml:mrow> <mml:mo>=</mml:mo> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">g</mml:mi> <mml:mi mathvariant="fraktur">l</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msub> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathfrak {g}= \mathfrak {gl}_{N+1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="German s German o Subscript 2 upper N"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">s</mml:mi> <mml:mi mathvariant="fraktur">o</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mn>2</mml:mn> <mml:mi>N</mml:mi> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">\mathfrak {so}_{2 N }</mml:annotation> </mml:semantics> </mml:math> </inline-formula> or <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="German e Subscript upper N"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">e</mml:mi> </mml:mrow> <mml:mi>N</mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">\mathfrak {e}_N</mml:annotation> </mml:semantics> </mml:math> </inline-formula> . We discuss their enumerative geometric meaning in the context of (open and closed) intersection theory of the moduli space of curves and its variants. Some of these <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper W"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">W</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {W}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> constraints have already appeared in the literature, but we find many new ones. For <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="German g German l Subscript upper N plus 1"> <mml:semantics> <mml:msub> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">g</mml:mi> <mml:mi mathvariant="fraktur">l</mml:mi> </mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>N</mml:mi> <mml:mo>+</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">\mathfrak {gl}_{N+1}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> our result hinges on the description of previously unnoticed Lie subalgebras of the algebra of modes. As a consequence, we obtain a simple characterization of the spectral curves (with arbitrary ramification) for which the Bouchard–Eynard topological recursion gives symmetric <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="omega Subscript g comma n"> <mml:semantics> <mml:msub> <mml:mi> ω </mml:mi> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi>g</mml:mi> <mml:mo>,</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:msub> <mml:annotation encoding="application/x-tex">\omega _{g,n}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> s and is thus well defined. For all such cases, we show that the topological recursion is equivalent to <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper W left-parenthesis German g German l right-parenthesis"> <mml:semantics> <mml:mrow> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">W</mml:mi> </mml:mrow> <mml:mo stretchy="false">(</mml:mo> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi mathvariant="fraktur">g</mml:mi> <mml:mi mathvariant="fraktur">l</mml:mi> </mml:mrow> <mml:mo stretchy="false">)</mml:mo> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {W}(\mathfrak {gl})</mml:annotation> </mml:semantics> </mml:math> </inline-formula> constraints realized as higher quantum Airy structures, and obtain a Givental-like decomposition for the corresponding partition functions.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.015
Threshold uncertainty score0.501

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.025
GPT teacher head0.300
Teacher spread0.275 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations12
Published2024
Admission routes2
Has abstractyes

Explore more

Same venueMemoirs of the American Mathematical SocietySame topicAlgebraic structures and combinatorial modelsFrench-language works237,207