Discrete mathematical modelling seminar
Seminar information archive ~12/08|Next seminar|Future seminars 12/09~
Organizer(s) | Tetsuji Tokihiro, Ralph Willox |
---|
2020/02/13
16:30-18:30 Room #126 (Graduate School of Math. Sci. Bldg.)
Sanjay Ramassamy (IPhT, CEA Saclay)
Embeddings adapted to two-dimensional models of statistical mechanics (English)
Sanjay Ramassamy (IPhT, CEA Saclay)
Embeddings adapted to two-dimensional models of statistical mechanics (English)
[ Abstract ]
A discrete model of statistical mechanics in 2D (for example simple random walk on the infinite square grid) can be defined on a graph without specifying a particular embedding of this graph. However, when stating that such a model converges to a conformally invariant object in the scaling limit, one needs to specify an embedding of the graph. For models which possess a local move, such as a star-triangle transformation, one would like the choice of the embedding to be compatible with that local move.
In this talk I will present a candidate for an embedding adapted to the 2D dimer model (a.k.a. random perfect matchings) on bipartite graphs, that is, graphs whose faces all have an even degree. This embedding is obtained by considering centers of circle patterns with the combinatorics of the graph on which the dimer model lives.
This is based on joint works with Dmitry Chelkak (École normale supérieure), Richard Kenyon (Yale University), Wai Yeung Lam (Université du Luxembourg) and Marianna Russkikh (MIT).
A discrete model of statistical mechanics in 2D (for example simple random walk on the infinite square grid) can be defined on a graph without specifying a particular embedding of this graph. However, when stating that such a model converges to a conformally invariant object in the scaling limit, one needs to specify an embedding of the graph. For models which possess a local move, such as a star-triangle transformation, one would like the choice of the embedding to be compatible with that local move.
In this talk I will present a candidate for an embedding adapted to the 2D dimer model (a.k.a. random perfect matchings) on bipartite graphs, that is, graphs whose faces all have an even degree. This embedding is obtained by considering centers of circle patterns with the combinatorics of the graph on which the dimer model lives.
This is based on joint works with Dmitry Chelkak (École normale supérieure), Richard Kenyon (Yale University), Wai Yeung Lam (Université du Luxembourg) and Marianna Russkikh (MIT).