Blocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model

Simple item page
dc.creatorBouttier, J.
dc.creatorDi Francesco, P.
dc.creatorGuitter, E.
dc.date2007-02-05
dc.date2008-03-07
dc.date.accessioned2026-07-07T09:25:20Z
dc.date.available2026-07-07T09:25:20Z
dc.descriptionWe introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees with labeled vertices, leading to a closed system of recursion relations for their generating functions. We discuss particular solvable cases in detail, as well as various applications of our method to several statistical systems such as spanning trees on quadrangulations, mutually excluding particles on Eulerian triangulations or the Ising model on quadrangulations.
dc.description39 pages, 18 figures, minor modifications
dc.identifierhttps://arxiv.org/abs/math/0702097
dc.identifierhttp://arxiv.org/abs/math/0702097
dc.identifierJ. Phys. A: Math. Theor. 40 (2007) 7411-7440
dc.identifierdoi:10.1088/1751-8113/40/27/002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156372
dc.subjectCombinatorics
dc.subjectStatistical Mechanics
dc.subjectMathematical Physics
dc.titleBlocked edges on Eulerian maps and mobiles: Application to spanning trees, hard particles and the Ising model
dc.typetext

Files

Collections

arXiv