Asymptotics of the Average Height of $2$–Watermelons with a Wall
Markus Fulmek · The Electronic Journal of Combinatorics · 2007
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2007
Abstract
We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length $n$) to the case of $p$–watermelons with a wall (i.e., to a certain family of $p$ nonintersecting Dyck paths; simple Dyck paths being the special case $p=1$.) An exact enumeration formula for the average height is easily obtained by standard methods and well–known results. However, straightforwardly computing the asymptotics turns out to be quite complicated. Therefore, we work out the details only for the simple case $p=2$.
Open the resolved locator · 10.37236/982
Metadata licence: OpenAlex metadata (CC0)