Universality and asymptotics of graph counting problems in non-orientable surfaces (Q986109): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:09, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Universality and asymptotics of graph counting problems in non-orientable surfaces |
scientific article |
Statements
Universality and asymptotics of graph counting problems in non-orientable surfaces (English)
0 references
11 August 2010
0 references
rooted maps
0 references
non-orientable surfaces
0 references
cubic ribbon graphs
0 references
quadrangulations
0 references
Stokes constants
0 references
Painlevé I asymptotics
0 references
Riemann-Hilbert method
0 references
Borel transform
0 references
trans-series
0 references
matrix models
0 references
double-scaling limit
0 references
instantons
0 references
