The six-vertex model on random planar maps revisited
From MaRDI portal
Publication:6345182
DOI10.1016/J.JCTA.2023.105739arXiv2007.07928MaRDI QIDQ6345182FDOQ6345182
Authors: Andrew Elvey Price, Paul Zinn-Justin 
Publication date: 15 July 2020
Abstract: We address the six vertex model on a random lattice, which in combinatorial terms corresponds to the enumeration of weighted 4-valent planar maps equipped with an Eulerian orientation. This problem was exactly, albeit non-rigorously solved by Ivan Kostov in 2000 using matrix integral techniques. We convert Kostov's work to a combinatorial argument involving functional equations coming from recursive decompositions of the maps, which we solve rigorously using complex analysis. We then investigate modular properties of the solution, which lead to simplifications in certain special cases. In particular, in two special cases of combinatorial interest we rederive the formulae discovered by Bousquet-M'elou and the first author.
Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Holomorphic modular forms of integral weight (11F11)
This page was built for publication: The six-vertex model on random planar maps revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345182)
