Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Minimal and maximal ...
Conference paper

Minimal and maximal plateau lengths in Motzkin paths

Helmut Prodinger (1) (2), Stephan Wagner (1) (2)
(1) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(2) Department of Mathematical Sciences [Stellenbosch University]
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2006
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Proceedings
DOI
10.46298/dmtcs.3520
License
https://about.hal.science/hal-authorisation-v1
Indicators
661
Views
589
Downloads

Minimal and maximal plateau lengths in Motzkin paths

Helmut Prodinger (1) (2), Stephan Wagner (1) (2)
(1) Department of Mathematical Sciences [Matieland, Stellenbosch Uni.]
(2) Department of Mathematical Sciences [Stellenbosch University]
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 <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.
Keywords
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Motzkin paths
  • singularity analysis
  • Mellin transform
  • bootstrapping
  • unary-binary trees
  • Gumbel distribution
Cited by

Source: OpenCitations

  • Enumeration of Łukasiewicz paths modulo some patterns

    Discrete Mathematics

    Authors : Jean-Luc Baril ORCID, Sergey Kirgizov ORCID, Armen Petrossian

    Journal reference : Volume 342, 2018, pp. 997-1005

    DOI : 10.1016/j.disc.2018.12.005
  • On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees

    Texts & monographs in symbolic computation/Texts and monographs in symbolic computation

    Authors : Helmut Prodinger ORCID, Sarah J. Selkirk ORCID, Stephan Wagner ORCID

    Journal reference : Volume , 2020, pp. 297-316

    DOI : 10.1007/978-3-030-44559-1_15
Preview
Loading PDF preview...