Combinatorics of hard particles on planar graphs

被引：14

作者：

Bouttier, J ^{[1
]}

Di Francesco, P ^{[1
]}

Guitter, E ^{[1
]}

机构：

[1] CEA Saclay, URA CNRS, SPhT, DSM,Serv Phys Theor, F-91191 Gif Sur Yvette, France

来源：

NUCLEAR PHYSICS B | 2003年 / 655卷 / 03期

关键词：

D O I：

10.1016/S0550-3213(03)00058-0

中图分类号：

O412 [相对论、场论]; O572.2 [粒子物理学];

学科分类号：

摘要：

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. (C) 2003 Elsevier Science B.V. All rights reserved.

引用

页码：313 / 341

页数：29

共 15 条

[1] Enumeration of planar constellations [J].

Bousquet-Mélou, M ;

Schaeffer, G .

ADVANCES IN APPLIED MATHEMATICS, 2000, 24 (04) :337-368

[2]

BOUSQUETMELOU M, MATHCO0211070

[3] Critical and tricritical hard objects on bicolourable random lattices: exact solutions [J].

Bouttier, J ;

Di Francesco, P ;

Guitter, E .

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2002, 35 (17) :3821-3854

[4] Census of planar maps: from the one-matrix model solution to a combinatorial proof [J].

Bouttier, J ;

Di Francesco, P ;

Guitter, E .

NUCLEAR PHYSICS B, 2002, 645 (03) :477-499

[5] PLANAR DIAGRAMS [J].

BREZIN, E ;

ITZYKSON, C ;

PARISI, G ;

ZUBER, JB .

COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1978, 59 (01) :35-51

[6]

DIFRANCESCO P, 1995, PHYS REP, V254, P1, DOI 10.1016/0370-1573(94)00084-G

[7]

EYNARD B, 2000, SACLAY LECT NOTES

[8]

POULALHON D, 2002, IN PRESS THEOR COMP

[9]

Poulalhon D., 2002, NOTE BIPARTITE EULER

[10]

Schaeffer G., 1997, ELECTRON J COMB, V4, pR20

← 1 2 →