University of Cambridge > Talks.cam > Dimer observables and Cauchy-Riemann operators > Dimer observables and Cauchy-Riemann operators

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

Dimer observables and Cauchy-Riemann operators

Download to your calendar using vCal

  • UserA series of six lectures by Julien Dubédat
  • ClockThursday 19 May 2016, 10:30-12:30
  • HouseCMS MR5.

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

A series of six lectures by Julien Dubédat will take place between 16-20 May. For full details see webpage http://www.statslab.cam.ac.uk/~beresty/DimerDay/progcourse.html

The dimer model is a fundamental example of exactly solvable planar statistical mechanics, due to its determinantal structure discovered by Kasteleyn. In the bipartite case, it corresponds to a height function which converges (in the appropriate phase) to the Gaussian Free Field, as shown in pioneering work of Kenyon. In this series of lectures, we consider further aspects of the scaling limit, that are suggested by (but not derivable from) the GFF invariance principle; the main point of view is that of families of Cauchy-Riemann operators.

Outline of lectures: Solvability and combinatorial aspects of the dimer model. Elements of discrete complex analysis. Singular observables and their scaling limits. Double-dimer observables and tau-functions.

This talk is part of the Dimer observables and Cauchy-Riemann operators series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Newnham College, Lucia Windsor Room test Bateman Room, Gonville & Caius College

Other talks

CONFERENCE: Chemical and material sciences enabled by AI and automation Title to be confirmed Feedback and the circumgalactic medium Title TBC Afternoon Break Afternoon Break
 

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