Related papers: Last Car Decomposition of Planar Maps
In this paper, we investigate how the initial models and the final models for the polynomial functors can be uniformly specified in matching logic.
We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random…
For a regular transient diffusion, we provide a decomposition of its last passage time to a certain state $\alpha$. This is accomplished by transforming the original diffusion into two diffusions using the occupation time of the area above…
The problem of classification of decomposable (in the sense of Stormer) positive maps between matrix algebras is presented. We propose the new notion of "finite" version of decomposability ($k$-decomposabilty). The characterisation of…
An elegant procedure which characterizes a decomposition of some class of binomial configurations into two other, resembling a definition of Pascal's Triangle, was given in \cite{gevay}. In essence, this construction was already presented…
We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of…
Consider a uniform rooted Cayley tree $T_{n}$ with $n$ vertices and let $m$ cars arrive sequentially, independently, and uniformly on its vertices. Each car tries to park on its arrival node, and if the spot is already occupied, it drives…
In this paper, we explore parking distributions on caterpillar trees, focusing on two primary statistics: the number of lucky cars and the frequency with which cars prefer specific parking spaces. We use first-return decomposition to reveal…
We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.
In this note, we study a factorization result for graded decomposition maps associated with the specializations of graded algebras. We obtain results previously known only in the ungraded setting.
The L-intersection graphs are the graphs that have a representation as intersection graphs of axis parallel shapes in the plane. A subfamily of these graphs are {L, |, --}-contact graphs which are the contact graphs of axis parallel L, |,…
Recently, the authors extended the notion of parking functions to parking sequences, which include cars of different sizes, and proved a product formula for the number of such sequences. We here give a refinement of that result involving…
We prove a strong law of large numbers for directed last passage times in an independent but inhomogeneous exponential environment. Rates for the exponential random variables are obtained from a discretisation of a speed function that may…
This article proposes two different approaches to automatically create a map for valid on-street car parking spaces. For this, we use car sharing park-out events data. The first one uses spatial aggregation and the second a machine learning…
In last passage percolation models lying in the KPZ universality class, long maximizing paths have a typical deviation from the linear interpolation of their endpoints governed by the two-thirds power of the interpolating distance. This…
Representations of planar triangulations as contact graphs of a set of internally disjoint homothetic triangles or of a set of internally disjoint homothetic squares have received quite some attention in recent years. In this paper we…
Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…
In this article, we discuss new models for static nonlinear deformations via scale-invariant conformal energy functionals based on the linear distortion. In particular, we give examples to show that, despite equicontinuity estimates giving…
We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…
In this note we provide a short proof of the distributional equality between last passage percolation with geometric weights along a general down-right path and Schur processes. We do this in both the full-space and half-space settings, and…