1978
DOI: 10.1007/bf01614153
|View full text |Cite
|
Sign up to set email alerts
|

Planar diagrams

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

49
2,019
0
23

Year Published

1996
1996
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 1,574 publications
(2,091 citation statements)
references
References 3 publications
49
2,019
0
23
Order By: Relevance
“…polihedron). This way leads to considering matrix integrals of the form [22] Z N (t) = Z X = X expf tr(X 2 + t 1 X 4 + t 2 X 6 + : : : g dX (2:7) where the integral should be taken over the space of all N N Hermitean matrices X. Here t 1 , t 2 ... are called coupling constants.…”
Section: @ @ @ [E @ F (1 + D)f] =mentioning
confidence: 99%
“…polihedron). This way leads to considering matrix integrals of the form [22] Z N (t) = Z X = X expf tr(X 2 + t 1 X 4 + t 2 X 6 + : : : g dX (2:7) where the integral should be taken over the space of all N N Hermitean matrices X. Here t 1 , t 2 ... are called coupling constants.…”
Section: @ @ @ [E @ F (1 + D)f] =mentioning
confidence: 99%
“…We pose this as an interesting problem, namely to find a useful quaternionic generalization of (1.1) for random non-hermitean matrices, and to develop the analogue of the work of Brézin et al [10] associated with it.…”
Section: Some Basic Formalismmentioning
confidence: 99%
“…In the large N limit, the poles merge into a cut (or several cuts) on the real axis. Powerful theorems from the theory of analytic functions can then be brought to bear to the problem of determining G(z) [10]. All of this is well-known.…”
Section: Introductionmentioning
confidence: 99%
“…In this article, we consider "formal" random matrix integrals, which are known to be generating functions for counting some classes of discrete surfaces [7,10,21,22,34].…”
Section: Introductionmentioning
confidence: 99%
“…In the formal model, N is thus an expansion parameter, and working order by order in N enumerates only discrete surfaces of a given topology [7]. An efficient method for dealing with this formal model is to consider the Schwinger-Dyson equations, called loop equations in this context [10,33].…”
Section: Introductionmentioning
confidence: 99%