The problem of enumerating maps (a map is a set of polygonal "countries" on a world of a certain topology, not necessarily the plane or the sphere) is an important problem in mathematics and physics, and it has many applications ranging from statistical physics, geometry, particle physics, telecommunications, biology, ... etc. This problem has been studied by many communities of researchers, mostly combinatorists, probabilists, and physicists. Since 1978, physicists have invented a method called "matrix models" to address that problem, and many results have been obtained. Besides, another important problem in mathematics and physics (in particular string theory), is to count Riemann surfaces. Riemann surfaces of a given topology are param...
Bender–Canfield showed that a plethora of graph counting problems in orientable/non-orientable surfa...
International audienceThis article investigates the intersection numbers of the moduli space of p-sp...
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of modul...
We consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology...
In a recent work, R. Pandharipande, J. P. Solomon and the second author have initiated a study of th...
The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link...
A study of the intersection theory on the moduli space of Riemann surfaces with boundary was recentl...
Maps are combinatorial objects arising in physics as the natural discretization of random surfaces u...
A map is an embedding of the vertices and edges of a graph into a compact 2-manifold such that the r...
In the first two lectures I will try to tell (or, rather, to give an idea) of how Maryam Mirzakhani ...
Abstract. We establish a simple recurrence formula for the number Qng of rooted orientable maps coun...
A map is a graph G embedded in a surface Σ such that each component of Σ−G is a simply connected reg...
AbstractBender–Canfield showed that a plethora of graph counting problems in orientable/non-orientab...
The main objects under consideration in this thesis are called maps, a certain class of graphs embed...
It is very common in mathematics to construct surfaces by identifying the sides of a polygon togethe...
Bender–Canfield showed that a plethora of graph counting problems in orientable/non-orientable surfa...
International audienceThis article investigates the intersection numbers of the moduli space of p-sp...
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of modul...
We consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology...
In a recent work, R. Pandharipande, J. P. Solomon and the second author have initiated a study of th...
The 2-matrix model has been introduced to study Ising model on random surfaces. Since then, the link...
A study of the intersection theory on the moduli space of Riemann surfaces with boundary was recentl...
Maps are combinatorial objects arising in physics as the natural discretization of random surfaces u...
A map is an embedding of the vertices and edges of a graph into a compact 2-manifold such that the r...
In the first two lectures I will try to tell (or, rather, to give an idea) of how Maryam Mirzakhani ...
Abstract. We establish a simple recurrence formula for the number Qng of rooted orientable maps coun...
A map is a graph G embedded in a surface Σ such that each component of Σ−G is a simply connected reg...
AbstractBender–Canfield showed that a plethora of graph counting problems in orientable/non-orientab...
The main objects under consideration in this thesis are called maps, a certain class of graphs embed...
It is very common in mathematics to construct surfaces by identifying the sides of a polygon togethe...
Bender–Canfield showed that a plethora of graph counting problems in orientable/non-orientable surfa...
International audienceThis article investigates the intersection numbers of the moduli space of p-sp...
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of modul...