Generalized Tamari intervals have been recently introduced by Préville-Ratelle and Viennot, and have been proved to be in bijection with (rooted planar) non-separable maps by Fang and ...Préville-Ratelle. We present two new bijections between generalized Tamari intervals and non-separable maps. Our first construction proceeds via separating decompositions on simple bipartite quadrangulations (which are known to be in bijection with non-separable maps). It can be seen as an extension of the Bernardi–Bonichon bijection between Tamari intervals and minimal Schnyder woods. On the other hand, our second construction relies on a specialization of the Bernardi–Bonichon bijection to so-called synchronized Tamari intervals, which are known to be in one-to-one correspondence with generalized Tamari intervals. It yields a trivariate generating function expression that interpolates between the bivariate generating function for generalized Tamari intervals, and the univariate generating function for Tamari intervals.
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 the name of regular edge-labelling and consists of two bipolar orientations that are transversal. For this reason, the terminology used here is that of transversal structures. The main results obtained in the article are a bijection between irreducible triangulations and ternary trees, and a straight-line drawing algorithm for irreducible triangulations. For a random irreducible triangulation with
n
vertices, the grid size of the drawing is asymptotically with high probability
11
n
/
27
×
11
n
/
27
up to an additive error of
O
(
n
)
. In contrast, the best previously known algorithm for these triangulations only guarantees a grid size
(
⌈
n
/
2
⌉
−
1
)
×
⌊
n
/
2
⌋
.
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on ...Eulerian maps with controlled vertex degrees. The mapping from blossoming trees to maps is a generalization to unfixed genus of Schaeffer's closing construction for planar Eulerian maps. The inverse mapping relies on the existence of canonical orientations which allow to equip the maps with canonical spanning trees, as proved by Bernardi. Our bijection gives in particular (here in the Eulerian case) a combinatorial explanation to the striking similarity between the (infinite) recursive system of equations which determines the partition function of maps with unfixed genus (as obtained via matrix models and orthogonal polynomials) and that determining the partition function of planar maps. All the functions in the recursive system get a combinatorial interpretation as generating functions for maps endowed with particular multiple markings of their edges. This allows us in particular to give a combinatorial proof of some differential identities satisfied by these functions. We also consider face-colored Eulerian maps with unfixed genus and derive some striking identities between their generating functions and those of properly weighted marked maps. The same methodology is then applied to deal with m-regular bipartite maps with unfixed genus, leading to similar results. The case of cubic maps is also briefly discussed.
Billey et al. arXiv:1507.04976 have recently discovered a surprisingly simple formula for the number $a_n(\sigma)$ of leaf-labelled rooted non-embedded binary trees (also known as phylogenetic trees) ...with $n\geq 1$ leaves, fixed (for the relabelling action) by a given permutation $\sigma\in\frak{S}_n$. Denoting by $\lambda\vdash n$ the integer partition giving the sizes of the cycles of $\sigma$ in non-increasing order, they show by a guessing/checking approach that if $\lambda$ is a binary partition (it is known that $a_n(\sigma)=0$ otherwise), then$$a_n(\sigma)=\prod_{i=2}^{\ell(\lambda)}(2(\lambda_i+\cdots+\lambda_{\ell(\lambda)})-1),$$and they derive from it a formula and random generation procedure for tanglegrams (and more generally for tangled chains). Our main result is a combinatorial proof of the formula for $a_n(\sigma)$, which yields a simplification of the random sampler for tangled chains.
We show that corner polyhedra and 3-connected Schnyder labelings join the growing list of planar structures that can be set in exact correspondence with (weighted) models of quadrant walks via a ...bijection due to Kenyon, Miller, Sheffield and Wilson.
Our approach leads to a first polynomial time algorithm to count these structures, and to the determination of their exact asymptotic growth constants : the number $p_n$ of corner polyhedra and $s_n$ of 3-connected Schnyder woods of size $n$ respectively satisfy $(p_n)^{1/n}\to 9/2$ and $(s_n)^{1/n}\to 16/3$ as $n$ goes to infinity.
While the growth rates are rational, like in the case of previously known instances of such correspondences, the exponent of the asymptotic polynomial correction to the exponential growth does not appear to follow from the now standard Denisov-Wachtel approach, due to a bimodal behavior of the step set of the underlying tandem walk. However a heuristic argument suggests that these exponents are $-1-\pi/\arccos(9/16)\approx -4.23$ for $p_n$ and $-1-\pi/\arccos(22/27)\approx -6.08$ for $s_n$, which would imply that the associated series are not D-finite.
Bijections for planar maps with boundaries Bernardi, Olivier; Fusy, Éric
Journal of combinatorial theory. Series A,
August 2018, 2018-08-00, Letnik:
158
Journal Article
Recenzirano
Odprti dostop
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For ...triangulations we recover the beautiful factorized formula obtained by Krikun using a (technically involved) generating function approach. The analogous formula for quadrangulations is new. We also obtain a far-reaching generalization for other face-degrees. In fact, all the known enumerative formulas for maps with boundaries are proved bijectively in the present article (and several new formulas are obtained).
Our method is to show that maps with boundaries can be endowed with certain “canonical” orientations, making them amenable to the master bijection approach we developed in previous articles. As an application of our enumerative formulas, we note that they provide an exact solution of the dimer model on rooted triangulations and quadrangulations.
In this paper, the scaling limit of random connected cubic planar graphs (respectively multigraphs) is shown to be the Brownian sphere. The proof consists in essentially two main steps. First, thanks ...to the known decomposition of cubic planar graphs into their 3-connected components, the metric structure of a random cubic planar graph is shown to be well approximated by its unique 3-connected component of linear size, with modified distances. Then, Whitney's theorem ensures that a 3-connected cubic planar graph is the dual of a simple triangulation, for which it is known that the scaling limit is the Brownian sphere. Curien and Le Gall have recently developed a framework to study the modification of distances in general triangulations and in their dual. By extending this framework to simple triangulations, it is shown that 3-connected cubic planar graphs with modified distances converge jointly with their dual triangulation to the Brownian sphere.
We present a bijection for toroidal maps that are essentially 3-connected (3-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite ...toroidal maps with all faces of degree 4 except for a hexagonal root-face. We show that these maps are in bijection with certain well-characterized bipartite unicellular maps. Our bijection, closely related to the recent one by Bonichon and Lévêque for essentially 4-connected toroidal triangulations, can be seen as the toroidal counterpart of the one developed in the planar case by Fusy, Poulalhon and Schaeffer, and it extends the one recently proposed by Fusy and Lévêque for essentially simple toroidal triangulations. Moreover, we show that rooted essentially 3-connected toroidal maps can be decomposed into two pieces, a toroidal part that is treated by our bijection, and a planar part that is treated by the above-mentioned planar case bijection. This yields a combinatorial derivation for the bivariate generating function of rooted essentially 3-connected toroidal maps, counted by vertices and faces.