Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof

Simple item page
dc.creatorBouttier, J.
dc.creatorDi Francesco, P.
dc.creatorGuitter, E.
dc.date2002-07-29
dc.date.accessioned2026-07-07T07:44:35Z
dc.date.available2026-07-07T07:44:35Z
dc.descriptionWe consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an alternative and purely combinatorial solution to the problem of counting arbitrary planar maps with prescribed vertex degrees.
dc.description29 pages, 14 figures, tex, harvmac, epsf
dc.identifierhttps://arxiv.org/abs/cond-mat/0207682
dc.identifierhttp://arxiv.org/abs/cond-mat/0207682
dc.identifierNucl.Phys. B645 (2002) 477-499
dc.identifierdoi:10.1016/S0550-3213(02)00813-1
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123251
dc.subjectStatistical Mechanics
dc.subjectHigh Energy Physics - Theory
dc.subjectCombinatorics
dc.titleCensus of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
dc.typetext

Files

Collections

arXiv