ще се проведе заседание на семинара на секция „Математически основи на информатиката”. Доклад на тема:
д-р Михаил Басок, гостуващ учен по програма ПИКОМ.
In this talk we consider a particular setup when the graph is given as a subgraph of a square lattice on the plane and the distribution on the space of dimer covers is uniform. Given a simply-connected domain we consider a sequence of such graphs approximating this domain as the step of the lattice tends to zero and sample the dimer model on each of the graphs. Classical theorem of Kenyon asserts that under a certain local combinatorial conditions the sequence of the corresponding (random) height functions has a conformally invariant limit. Moreover, this limit is proven to be the Gaussian free field with Dirichlet boundary conditions in the initial domain.
We will discuss heuristics behind this theorem and the approтach to proving it via discrete complex analysis developed by Kenyon. If time permits, we will also discuss random loop ensembles arising from a pair of two independent dimer covers and its convergence to a conformally invariant limit proved in our joint work with Dmitry Chelkak.