Combinatorics of hard particles on planar graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Nuclear Physics B Année : 2003

Combinatorics of hard particles on planar graphs

Résumé

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.

Dates et versions

hal-00586663 , version 1 (18-04-2011)

Identifiants

Citer

Jérémie Bouttier, Philippe Di Francesco, Emmanuel Guitter. Combinatorics of hard particles on planar graphs. Nuclear Physics B, 2003, 655 (3), pp.313 - 341. ⟨10.1016/S0550-3213(03)00058-0⟩. ⟨hal-00586663⟩
281 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More