University of Cambridge > Talks.cam > Quantum Fields and Strings Seminars > Modular-invariant random matrix theory and AdS3 wormholes

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Modular-invariant random matrix theory and AdS3 wormholes

Download to your calendar using vCal

  • UserFelix Haehl (University of Southampton)
  • ClockThursday 22 January 2026, 13:00-14:00
  • HousePotter room.

If you have a question about this talk, please contact Klaas Parmentier .

I will describe a non-perturbative definition of RMT2 : a generalization of random matrix theory that is compatible with the symmetries of 2d CFT . Given any random matrix ensemble, its spectral correlations admit a modular-invariant lift to RMT2 , which reduce to the original random matrix correlators in a near-extremal limit. The lift proceeds in two steps: I will first discuss a Mellin space formulation of RMT . The Mellin space correlators are then interpreted as an SL(2,Z) spectral decomposition. This sheds a new light on the AdS3 wormhole geometries with multiple torus boundaries.

This talk is part of the Quantum Fields and Strings Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

MR5 Centre for Mathematical Sciences Department of Chemical Engineering & Biotechnology Meeting Rooms 1&2, MRC Epidemiology Unit, Level 3, Institute of Metabolic Science, Cambridge Biomedical Campus, Cambridge CB2 0QQ

Other talks

The organisational management of traumatic stress A flexible Monte Carlo quantitative bias analysis for unmeasured confounding Good and Evil Plasma Cells: Guardians & Saboteurs of Immunity Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa A Unified Framework for Change of Measure Inequalities: Applications to Generalization, Memorization and Privacy TBC
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity