E. Guitter

Learn More
We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, in bijection with a new class of labeled trees, which we call mobiles. Our bijection covers all the classes of maps previously enumerated by either the two-matrix model used by physicists or by the(More)
The statistics of meander and related problems are studied as particular realizations of compact polymer chain foldings. This paper presents a general discussion of these topics, with a particular emphasis on three points: (i) the use of a direct recursive relation for building (semi) meanders (ii) the equivalence with a random matrix model (iii) the exact(More)
We consider quadrangulations with a boundary and derive explicit expressions for the generating functions of these maps with either a marked vertex at a prescribed distance from the boundary, or two boundary vertices at a prescribed mutual distance in the map. For large maps, this yields explicit formulas for the bulk-boundary and boundary-boundary(More)
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees with labeled vertices, leading to a closed system of recursion relations for their generating functions. We discuss(More)
We introduce and solve a generalized 1+1D Lorentzian gravity model in which a certain subclass of baby-universes is allowed, the occurrence of these being governed by a coupling constant β. Combining transfer matrix-, saddle point-and path integral techniques we show that for β < 1 it is possible to take a continuum limit in which the model is described by(More)
We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating the topologically inequivalent configurations of a meandering road crossing a straight river through a given number of(More)
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have faces of arbitrarily large degree, which requires new bijections to be tackled. We obtain exact expressions for the(More)
We present a purely combinatorial solution of the problem of enumerating pla-nar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be(More)