Minimal and maximal plateau lengths in Motzkin paths - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2007

Minimal and maximal plateau lengths in Motzkin paths


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.
Fichier principal
Vignette du fichier
dmAH0127.pdf (206.58 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184768 , version 1 (17-08-2015)



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, ⟨10.46298/dmtcs.3520⟩. ⟨hal-01184768⟩


70 View
462 Download



Gmail Facebook Twitter LinkedIn More