Geodesic
Minimal and maximal plateau lengths in Motzkin paths
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07) (2007).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2007_special_253_a2,
     author = {Prodinger, Helmut and Wagner, Stephan},
     title = {Minimal and maximal plateau lengths in {Motzkin} paths},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)},
     year = {2007},
     doi = {10.46298/dmtcs.3520},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3520/}
}
TY  - JOUR
AU  - Prodinger, Helmut
AU  - Wagner, Stephan
TI  - Minimal and maximal plateau lengths in Motzkin paths
JO  - Discrete mathematics & theoretical computer science
PY  - 2007
VL  - DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3520/
DO  - 10.46298/dmtcs.3520
LA  - en
ID  - DMTCS_2007_special_253_a2
ER  - 
%0 Journal Article
%A Prodinger, Helmut
%A Wagner, Stephan
%T Minimal and maximal plateau lengths in Motzkin paths
%J Discrete mathematics & theoretical computer science
%D 2007
%V DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3520/
%R 10.46298/dmtcs.3520
%G en
%F DMTCS_2007_special_253_a2
Prodinger, Helmut; Wagner, Stephan. Minimal and maximal plateau lengths in Motzkin paths. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07), DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07) (2007). doi : 10.46298/dmtcs.3520. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3520/

Cité par Sources :