Skip to Main content Skip to Navigation
Conference papers

Minimal and maximal plateau lengths in Motzkin paths

Abstract : 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 maximal plateau length, horizontal segment and maximal horizontal segment 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.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184768
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, August 17, 2015 - 4:58:45 PM
Last modification on : Thursday, May 11, 2017 - 1:02:51 AM
Long-term archiving on: : Wednesday, November 18, 2015 - 12:14:39 PM

File

dmAH0127.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184768, version 1

Collections

Citation

Helmut Prodinger, Stephan Wagner. Minimal and maximal plateau lengths in Motzkin paths. 2007 Conference on Analysis of Algorithms, AofA 07, 2007, Juan les Pins, France. pp.389-402. ⟨hal-01184768⟩

Share

Metrics

Record views

128

Files downloads

535