Related papers: Last Car Decomposition of Planar Maps
Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any…
Scattering amplitudes for colored theories have recently been formulated in a new way, in terms of curves on surfaces. In this note we describe a canonical set of functions we call surface functions, associated to all orders in the…
We study the directed last-passage percolation model on the planar square lattice with nearest-neighbor steps and general i.i.d. weights on the vertices, outside of the class of exactly solvable models. Stationary cocycles are constructed…
A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are…
We are interested in the cycles obtained by slicing at all heights random Boltzmann triangulations with a simple boundary. We establish a functional invariance principle for the lengths of these cycles, appropriately rescaled, as the size…
Parking problems derive from works in combinatorics by Konheim and Weiss in the 1960s. In a memorable contribution, Lackner and Panholzer (2016) studied parking on a random tree and established a phase transition for this process when \(m…
The parking-lot model provides a qualitative description of the main features of the phenomenology of granular compaction. We derive here approximate kinetic equations for this model, equations that are based on a $2-$parameter…
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
We calculate generating functions for the Poincare polynomials of moduli spaces of pointed curves of genus zero and of Configuration Spaces of Fulton and MacPherson. We also prove that contributions of multiple coverings of curves in a…
We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower…
We present an algorithm that enumerates all the minimal triangulations of a graph in incremental polynomial time. Consequently, we get an algorithm for enumerating all the proper tree decompositions, in incremental polynomial time, where…
We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
We present a canonical way to decompose finite graphs into highly connected local parts. The decomposition depends only on an integer parameter whose choice sets the intended degree of locality. The global structure of the graph, as…
We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…
We construct tree-decompositions of graphs that distinguish all their k-blocks and tangles of order k, for any fixed integer k. We describe a family of algorithms to construct such decompositions, seeking to maximize their diversity subject…