清华主页 EN
导航菜单

The six-vertex model on random graphs | Integrable System Lunch Seminar

来源: 05-12

时间:2024-05-13 Mon 12:00-13:00

地点:A4-1

组织者:Nicolai Reshetikhin, Bart Vlaar, Ruijie Xu

主讲人: lvan Kostov BIMSA Institut de physique thorique, University Paris-Saclay, CNRS and CEA

Abstract

I will explain how to reformulate the 6v model on dynamical random lattices as an NxN matrixmodel. The spectral curve of the 6v matrix model at large N is an infinite envelope of a two-dimensional torus. An explicit global parametrisation is found by eliptic theta functions. The scalinglimit where the size of the lattices diverge is achieved when the torus degenerates into an infinitecylinder. lt is argued that the scaling limit is described by a c=1 compactified boson coupled toLiouvile gravity. The situation is less clear for lattices with boundaries where the boundaryobservables computed in the matrix model show unusual behaviour and stil lack Liouville gravitydescription.


Speaker Intro

Ivan Kostov obtained his PhD in 1982 from the Moscow State University, with scientific advisersVladimir Feinberg and Alexander Migdal. Then he worked in the group of lvan Todorov at theINRNE Sofia, and since 1990 as a CNRS researcher at the IPhT, CEA-Saclay, France. Currently heis emeritus DR CNRS at lPhT and a visiting professor at UFES, Vitoria, Brazil.


返回顶部
相关文章
  • Harmonic locus and Calogero-Moser spaces | Integrable System Lunch Seminar

    AbstractWe study the harmonic locus consisting of the monodromy-free Schroedinger operators withrational potential and quadratic growth at infinity. lt is known after Oblomkov, that it can be identifiedwith the set of all partitions via Wronskian map for Hermite polynomials. We show that the harmoniclocus can also be identified with the subset of the Calogero-Moser space introduced by Wilson,wh...

  • YMSC Probability Seminar | Extreme eigenvalues of random regular graphs

    AbstractExtremal eigenvalues of graphs are of particular interest in theoretical computer science and combinatorics. Specifically, the spectral gap—the gap between the first and second largest eigenvalues—measures the expanding property of the graph. In this talk, I will focus on random $d$-regular graphs, for which the largest eigenvalue is $d$.I'll first explain some conjectures on the extr...