Related papers: Some families of increasing planar maps
We study the asymptotic behaviour of random integer partitions under a new probability law that we introduce, the Plancherel-Hurwitz measure. This distribution, which has a natural definition in terms of Young tableaux, is a deformation of…
Packing of spheres is a problem with a long history dating back to Kepler's conjecture in 1611. The highest density is realized in face-centred-cubic (FCC) and hexagonal-close-packed (HCP) arrangements. These are only limiting examples of…
In this work, we prove three types of results with the strategy that, together, the author believes these should imply the local version of Hilbert's Fifth problem. In a separate development, we construct a nontrivial topology for rings of…
Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…
Consider the minimum spanning tree (MST) of the complete graph with n vertices, when edges are assigned independent random weights. Endow this tree with the graph distance renormalized by n^{1/3} and with the uniform measure on its…
We study here a standard next-nearest-neighbor (NNN) model of ballistic growth on one- and two-dimensional substrates focusing our analysis on the probability distribution function $P(M,L)$ of the number $M$ of maximal points (i.e., local…
In this paper we deduce a universal result about the asymptotic distribution of roots of random polynomials, which can be seen as a complement to an old and famous result of Erdos and Turan. More precisely, given a sequence of random…
If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with…
We study the exponentially small splitting of separatrices in an analytic one-parameter family of area-preserving maps that generically unfolds a 1:3 resonance. Near the resonance the normal form theory predicts existence of a small…
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…
Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the…
We study the statistical properties of geodesics, i.e. paths of minimal length, in large random planar quadrangulations. We extend Schaeffer's well-labeled tree bijection to the case of quadrangulations with a marked geodesic, leading to…
We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…
Consider a branching random walk in which the offspring distribution and the moving law both depend on an independent and identically distributed random environment indexed by the time.For the normalised counting measure of the number of…
We study the statistics of edges and vertices in the vicinity of a reference vertex (origin) within random planar quadrangulations and Eulerian triangulations. Exact generating functions are obtained for theses graphs with fixed numbers of…
For each certain "nice" piecewise linear function $f:[0,1] \to [0,1]$, we consider a family of growing Young diagrams $\{\lambda(f,N)\}_{N=1}^{\infty}$ by enlarging the region under the graph of $f$. We compute asymptotic formulas for the…
Kupavskii, Volostnov, and Yarovikov have recently shown that any set of $n$ points in general position in the plane has at least as many (partial) triangulations as the convex $n$-gon. We generalize this in two directions: we show that…
We give bijections between bipolar-oriented (acyclic with unique source and sink) planar maps and certain random walks, which show that the uniformly random bipolar-oriented planar map, decorated by the "peano curve" surrounding the tree of…
The work that consists of two parts is devoted to the problem of enumerating unrooted $r$-regular maps on the torus up to all its symmetries. We begin with enumerating near-$r$-regular rooted maps on the torus, projective plane and the…
Given a planar triangulation, a 3-orientation is an orientation of the internal edges so all internal vertices have out-degree three. Each 3-orientation gives rise to a unique edge coloring known as a Schnyder wood that has proven powerful…