Related papers: Asymptotics of the average height of 2--watermelon…

We derive asymptotics for the moments as well as the weak limit of the height distribution of watermelons with p branches with wall. This generalises a famous result of de Bruijn, Knuth and Rice on the average height of planted plane trees,…

We determine the weak limit of the distribution of the random variables "height" and "range" on the set of p-watermelons without wall restriction as the number of steps tends to infinity. Additionally, we provide asymptotics for the moments…

A watermelon is a set of $p$ Bernoulli paths starting and ending at the same ordinate, that do not intersect. In this paper, we show the convergence in distribution of two sorts of watermelons (with or without wall condition) to processes…

Using path integral techniques, we compute exactly the distribution of the maximal height H_p of p nonintersecting Brownian walkers over a unit time interval in one dimension, both for excursions (p-watermelons with a wall) and bridges…

We perform an exact and asymptotic analysis of the model of $n$ vicious walkers interacting with a wall via contact potentials, a model introduced by Brak, Essam and Owczarek. More specifically, we study the partition function of watermelon…

Recently, in the context of walks of hexagonal circle packings, interest has emerged in the family of skew Dyck paths with two variants of down-steps. These paths have steps $U, D_g, D_b, L=D_r$. Using generating functions, the kernel…

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

For any pattern $p$ of length at most two, we provide generating functions and asymptotic approximations for the number of $p$-equivalence classes of Dyck paths with catastrophes, where two paths of the same length are $p$-equivalent…

There was recent interest in Motzkin paths without peaks (peak: up-step followed immediately by down-step); additional results about this interesting family is worked out. The new results are the enumeration of such paths that live in a…

We derive new results for the number of star and watermelon configurations of vicious walkers in the presence of an impenetrable wall by showing that these follow from standard results in the theory of Young tableaux, and combinatorial…

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…

Dyck paths having height at most $h$ and without valleys at height $h-1$ are combinatorially interpreted by means of 312-avoding permutations with some restrictions on their \emph{left-to-right maxima}. The results are obtained by analyzing…

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

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…

We introduce a pairing on local intersection cohomology groups of variations of pure Hodge structure, which we call the asymptotic height pairing. Our original application of this pairing was to answer a question on the Ceresa cycle posed…

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…

The aim of this paper is twofold. First, we study the asymptotics of the N\'eron height pairing between degree-zero divisors on a family of degenerating compact Riemann surfaces parametrized by an algebraic curve. We show that if the…

We analyze some enumerative and asymptotic properties of Dyck paths under a line of slope 2/5.This answers to Knuth's problem \\#4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June…

We study the watermelon probabilities in the uniform spanning forests on the two-dimensional semi-infinite square lattice near either open or closed boundary to which the forests can or cannot be rooted, respectively. We derive universal…

This is the second in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. The first…