Helmut Prodinger ; Stephan Wagner
-
Minimal and maximal plateau lengths in Motzkin paths
dmtcs:3520 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2007,
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
-
https://doi.org/10.46298/dmtcs.3520
Minimal and maximal plateau lengths in Motzkin pathsArticle
Authors: Helmut Prodinger 1; Stephan Wagner 1
NULL##NULL
Helmut Prodinger;Stephan Wagner
1 Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
The minimal length of a plateau (a sequence of horizontal steps, preceded by an up- and followed by a down-step) in a Motzkin path is known to be of interest in the study of secondary structures which in turn appear in mathematical biology. We will treat this and the related parameters <i> maximal plateau length, horizontal segment </i>and <i>maximal horizontal segment </i>as well as some similar parameters in unary-binary trees by a pure generating functions approach―-Motzkin paths are derived from Dyck paths by a substitution process. Furthermore, we provide a pretty general analytic method to obtain means and limiting distributions for these parameters. It turns out that the maximal plateau and the maximal horizontal segment follow a Gumbel distribution.