Related papers: Last Car Decomposition of Planar Maps
A separation of a graph $G$ is a partition $(A_1, A_2, C)$ of $V(G)$ such that $A_1$ is anticomplete to $A_2$. A classic result from Robertson and Seymour's Graph Minors Project states that there is a correspondence between tree…
The original models of causal dynamical triangulations construct space-time by arranging a set of simplices in layers separated by a fixed time-like distance. The importance of the foliation structure in the 2+1 dimensional model is studied…
We study the last-passage growth model on the planar integer lattice with exponential weights. With boundary conditions that represent the equilibrium exclusion process as seen from a particle right after its jump we prove that the variance…
The purpose of the present work is twofold. First, we develop the theory of general self-similar growth-fragmentation processes by focusing on martingales which appear naturally in this setting and by recasting classical results for…
We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…
We introduce new probabilistic arguments to derive optimal-order central moment bounds in planar directed last-passage percolation. Our technique is based on couplings with the increment-stationary variants of the model, and is presented in…
We settle the Path Decomposition Conjecture (P.D.C.) due to Tibor Gallai for minimally connected graphs, i.e. trees. We use this validity for trees and settle the P. D. C. using induction on the number of edges for all connected graphs. We…
In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most $k$, when an effective…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
We present a new derivation of the distance-dependent two-point function of random planar triangulations. As it is well-known, this function is intimately related to the generating functions of so-called slices, which are pieces of…
We review three examples of functors from Lorentzian categories and their applications in finiteness results, singularity theorems and boundary constructions. The third example is a novel functor from the category of ordered measure spaces…
We establish new and different kinds of proofs of properties that arise due to the orthogonal decomposition of the Hilbert space, including projections, over the unit interval of one dimension. We also see angles between functions,…
In this paper an extended CPR decomposition theorem for Finsler symmetric spaces of semi-negative curvature in the context of reductive structures is proven. This decomposition theorem is applied to give a geometric description of the…
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…
We study three representations of hierarchies of partitions: dendrograms (direct representations), saliency maps, and minimum spanning trees. We provide a new bijection between saliency maps and hierarchies based on quasi-flat zones as used…
We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an…
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…
There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of…
We develop a holonomy reduction procedure for general Cartan geometries. We show that, given a reduction of holonomy, the underlying manifold naturally decomposes into a disjoint union of initial submanifolds. Each such submanifold…
We introduce patterns on a triangular grid generated by paperfolding operations. We show that in case these patterns are defined using a periodic sequence of foldings, they can also be generated using substitution rules and compute…