Combinatorics of Hard Particles on Planar Graphs
classification
❄️ cond-mat.stat-mech
hep-thmath-phmath.COmath.MP
keywords
planarcombinatorialgraphshardparticlesproblemcombinatoricsdecorated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.