COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Quantum Fields and Strings Seminars > Boundary Description of Microstates of the Non-Supersymmetric Two-Dimensional Black Hole
Boundary Description of Microstates of the Non-Supersymmetric Two-Dimensional Black HoleAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Chiung Hwang. In the non-supersymmetric matrix quantum mechanics (MQM) dual to the 2d black hole, we identify a set of degenerate states as the duals of black hole microstates. At leading order in large N , the log of number of these states (already calculated by Gross and Klebanov) matches the Bekenstein-Hawking entropy formula, and also agrees with one of two candidates found by Kazakov and Tseytlin. The mass term in Kazakov and Tseytlin’s free energy also matches the energy of these states conjectured by Gross and Klebanov; we show this conjecture. We also calculate the microcanonical entropy in a higher-energy phase, which we conjecture to be dual to the c = 0 phase of 2d string theory. We try to interpret our results in string theoretic terms and find that it is consistent with some arguments of Sathiapalan, Kogan and Atick and Witten regarding the phase structure of string theory. Finally, we discuss a tantalising analogy to Motzkin walk models. 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 listsIntroducing the Cambridge Migration Research Forum (CAMMIGRES): An Event for New Graduates Cambridge Rare Disease Network Machine Learning Reading Group @ CUEDOther talksFormal Dinner, Murray Edward Gateway Advisory Board The inductive McKay—Navarro conditions for the prime 2 and some groups of Lie type. Protecting privacy on the Internet: background, research, and practice Conformal Geodesics Fundamental Limits of Learning with Feedforward and Recurrent Neural Networks |