Census of planar maps: From the one-matrix model solution to a combinatorial proof
From MaRDI portal
Publication:701544
DOI10.1016/S0550-3213(02)00813-1zbMATH Open0999.05052arXivcond-mat/0207682OpenAlexW3099542467MaRDI QIDQ701544FDOQ701544
Philippe Di Francesco, Emmanuel Guitter, Bouttier
Publication date: 3 November 2002
Published in: Nuclear Physics B (Search for Journal in Brave)
Abstract: We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an alternative and purely combinatorial solution to the problem of counting arbitrary planar maps with prescribed vertex degrees.
Full work available at URL: https://arxiv.org/abs/cond-mat/0207682
Cites Work
- Planar diagrams
- A Census of Planar Maps
- Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
- Eigenvalue distribution of large random matrices, from one matrix to several coupled matrices
- A Census of Slicings
- A Census of Planar Triangulations
- Enumeration of planar constellations
- Counting colored random triangulations
- A Census of Hamiltonian Polygons
- Coloring random triangulations
- Critical and tricritical hard objects on bicolourable random lattices: exact solutions
Cited In (39)
- Blossoming bijection for higher-genus maps
- Spanning forests in regular planar maps
- Random matrices, graphical enumeration and the continuum limit of Toda lattices
- Multicritical continuous random trees
- The three-point function of planar quadrangulations
- Planar maps and continued fractions
- Unified bijections for maps with prescribed degrees and girth
- Liouville quantum gravity and KPZ
- A bijection for triangulations, quadrangulations, pentagulations, etc.
- Bounds on the critical line via transfer matrix methods for an Ising model coupled to causal dynamical triangulations
- The enumeration of planar graphs via Wick's theorem
- The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
- Enumeration of Eulerian and unicursal planar maps
- Universality and asymptotics of graph counting problems in non-orientable surfaces
- Integrability of graph combinatorics via random walks and heaps of dimers
- Geodesic distance in planar graphs
- Bijective proof of the rationality of the generating series of higher-genus maps
- A free-algebraic solution for the planar approximation
- A simple formula for the series of constellations and quasi-constellations with boundaries
- Counting coloured planar maps
- Maps of unfixed genus and blossoming trees
- A bijection for triangulations of a polygon with interior points and multiple edges
- Geodesic distance in planar graphs: an integrable approach
- Potts model coupled to random causal triangulations
- On the Diameter of Random Planar Graphs
- A diagrammatic equation for oriented planar graphs
- A bijection for nonorientable general maps
- On the planar free energy of matrix models
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- Critical behaviour of spanning forests on random planar graphs
- A generic method for bijections between blossoming trees and planar maps
- Analyticity of the planar limit of a matrix model
- Enumeration of unrooted odd-valent regular planar maps
- A note on enumeration of one-vertex maps
- Rectangular matrix models and combinatorics of colored graphs
- A noncommutative enumeration problem
- Combinatorics of hard particles on planar graphs
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Counting colored planar maps: algebraicity results
This page was built for publication: Census of planar maps: From the one-matrix model solution to a combinatorial proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701544)
