Combinatorics of Hard Particles on Planar Graphs
Statistical Mechanics
2010-04-05 v1 High Energy Physics - Theory
Mathematical Physics
Combinatorics
math.MP
Abstract
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in this purely combinatorial language.
Keywords
Cite
@article{arxiv.cond-mat/0211168,
title = {Combinatorics of Hard Particles on Planar Graphs},
author = {J. Bouttier and P. Di Francesco and E. Guitter},
journal= {arXiv preprint arXiv:cond-mat/0211168},
year = {2010}
}
Comments
35 pages, 20 figures, tex, harvmac, epsf