Counting planar diagrams with various restrictions
arXiv:hep-th/9808113 · doi:10.1016/S0550-3213(98)00697-X
Abstract
Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions, in the sense that one wishes to omit `tadpole' inserions and `seagull' insertions; at a later stage also self-energy insertions are to be removed, and finally also the dressed 3-point inserions and the dressed 4-point insertions. Diagrams with such restrictions can all be counted exactly. This results in various critical lines in the - plane, where and are effective zero-dimensional coupling constants. These lines can be localized exactly.
24 pages TeX, 16 figures Postscript
Cited by in corpus (8)
- The arrow of time, black holes, and quantum mixing of large N Yang-Mills theories
- Using the Hopf Algebra Structure of QFT in Calculations
- Hedin's equations and enumeration of Feynman's diagrams
- CFT approach to constraint operators for (-deformed) hermitian one-matrix models
- Diagrammatic proof of the BCFW recursion relation for gluon amplitudes in QCD
- Parquet Approximation for Large N Matrix Higgs Model
- Addressing energy density functionals in the language of path-integrals I: Comparative study of diagrammatic techniques applied to the (0+0)-D -symmetric -theory
- The F model on dynamical quadrangulations