208 citations · 2.7k across the 84 of their papers we have counts for
87 papers
Recursions and ODEs for the correlators in integrable systems and random matrices
Bertrand Eynard, Dimitrios Mitsios, Soufiane Oukassi
An integrable system is often formulated as a flat connection, satisfying a Lax equation. It is given in terms of compatible systems having a common solution called the ``wave func…
Resurgent Asymptotics of Jackiw-Teitelboim Gravity and the Nonperturbative Topological Recursion
Bertrand Eynard, Elba Garcia-Failde, Paolo Gregori +2
Jackiw-Teitelboim dilaton-quantum-gravity localizes on a double-scaled random-matrix model, whose perturbative free energy is an asymptotic series. Understanding the resurgent prop…
A new formula for intersection numbers
Bertrand Eynard, Dimitrios Mitsios
We propose a new formula to compute Witten--Kontsevich intersection numbers. It is a closed formula, not involving recursion neither solving equations. It only involves sums over p…
A natural basis for intersection numbers
Bertrand Eynard, Danilo Lewański
We advertise elementary symmetric polynomials as the natural basis for generating series of intersection numbers of genus g and n marked points. Closed formulae for…
Quantization of classical spectral curves via topological recursion
Bertrand Eynard, Elba Garcia-Failde, Olivier Marchal +1
We prove that the topological recursion formalism can be used to quantize any generic classical spectral curve with smooth ramification points and simply ramified away from poles.…
Topological recursion for generalised Kontsevich graphs and r-spin intersection numbers
Raphaël Belliard, Séverin Charbonnier, Bertrand Eynard +1
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture.…