Related papers: Peakless Motzkin paths of bounded height

In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice…

We consider random temporal graphs, a version of the classical Erd\H{o}s--R\'enyi random graph G(n,p) where additionally, each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time…

We discuss asymptotics of large Boltzmann random planar maps such that every vertex of degree $k$ has weight of order $k^{-2}$. Infinite maps of that kind were studied by Budd, Curien and Marzouk. These maps can be seen as the dual of the…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

We consider the growth of heights of the points of the orbits of (piecewise) affine maps of the plane, with rational parameters. We analyse the asymptotic growth rate of both global and local ($p$-adic) heights, for the primes $p$ that…

The Motzkin spin chain is a spin-1 model introduced in \cite{shor} as an example of a system exhibiting a high degree of quantum fluctuations whose ground state can be mapped to Motzkin paths that are generated with local equivalence moves.…

The notion of symmetric and asymmetric peaks in Dyck paths was introduced by Fl\'orez and Rodr\'{\i}guez, who counted the total number of such peaks over all Dyck paths of a given length. In this paper we generalize their results by giving…

For fixed non-negative integers $k$, $t$, and $n$, with $t < k$, a $k_t$-Dyck path of length $(k+1)n$ is a lattice path that starts at $(0, 0)$, ends at $((k+1)n, 0)$, stays weakly above the line $y = -t$, and consists of steps from the…

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Paths that consist of up-steps of one unit and down-steps of $k$ units, being bounded below by a horizontal line $-t$, behave like $t+1$ ordered tuples of $k$-Dyck paths, provided that $t\le k$. We describe the general case, allowing $t$…

Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…

In this paper we consider a model for the diffusion of a population in a strip-shaped field, where the growth of the species is governed by a Fisher-KPP equation and which is bounded on one side by a road where the species can have a…

In this paper, we propose a kernel method for exact tail asymptotics of a random walk to neighborhoods in the quarter plane. This is a two-dimensional method, which does not require a determination of the unknown generating function(s).…

We derive exactly the number of Hamiltonian paths H(n) on the two dimensional Sierpinski gasket SG(n) at stage $n$, whose asymptotic behavior is given by $\frac{\sqrt{3}(2\sqrt{3})^{3^{n-1}}}{3} \times (\frac{5^2 \times 7^2 \times…

A maximally linkless graph is a graph that can be embedded in $\mathbb{R}^3$ without any links, but cannot be embedded in such a way if any other edge is added to the graph. Recently, a family of maximally linkless graphs was found with…

Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…

At high levels, the asymptotic distribution of a stationary, regularly varying Markov chain is conveniently given by its tail process. The latter takes the form of a geometric random walk, the increment distribution depending on the sign of…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

We study asymptotic properties of spatially non-homogeneous random walks with non-integrable increments, including transience, almost-sure bounds, and existence and non-existence of moments for first-passage and last-exit times. In our…

Recently, Okounkov, Lazarsfeld and Mustata, and Kaveh and Khovanskii have shown that the growth of a graded linear series on a projective variety over an algebraically closed field is asymptotic to a polynomial. We give a complete…