From combinatorial maps to correlation functions in loop models
Linnea Grans-Samuelsson, Jesper Lykke Jacobsen, Rongvoram Nivesvivat,, Sylvain Ribault, Hubert Saleur

TL;DR
This paper introduces a new combinatorial approach to calculating correlation functions in 2D loop models, connecting combinatorial maps with conformal bootstrap solutions and expanding the understanding of statistical physics models.
Contribution
It defines a class of correlation functions from combinatorial maps, conjectures their role as a basis in conformal bootstrap equations, and tests this through solution counting.
Findings
Correlation functions form a basis of solutions in the critical limit.
The approach includes all known O(N) and Potts model correlations.
New correlation functions outside known models are also encompassed.
Abstract
In two-dimensional statistical physics, correlation functions of the O(N) and Potts models may be written as sums over configurations of non-intersecting loops. We define sums associated to a large class of combinatorial maps (also known as ribbon graphs). We allow disconnected maps, but not maps that include monogons. Given a map with n vertices, we obtain a function of the moduli of the corresponding punctured Riemann surface. Due to the map's combinatorial (rather than topological) nature, that function is single-valued, and we call it an n-point correlation function. We conjecture that in the critical limit, such functions form a basis of solutions of certain conformal bootstrap equations. They include all correlation functions of the O(N) and Potts models, and correlation functions that do not belong to any known model. We test the conjecture by counting solutions of crossing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Combinatorial Mathematics · Markov Chains and Monte Carlo Methods
