On Computing the Total Displacement Number via Weighted Motzkin Paths

DOI10.1007/978-3-319-44543-4_33zbMath1482.05010arXiv1606.05538OpenAlexW3099041676MaRDI QIDQ2819524

Andreas Bärtschi, Daniel Graf, Paolo Penna, Thomas Tschager, Barbara Geissmann, Tomas Hruz

Publication date: 29 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.05538

zbMATH Keywords

generating functionMotzkin pathpermutation statistic

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (2)

Permutations in two dimensions that maximally separate neighbors ⋮ On Computing the Total Displacement Number via Weighted Motzkin Paths

Uses Software

• OEIS

Cites Work

• A bijective approach to the area of generalized Motzkin paths
• The generating function for total displacement
• A history and a survey of lattice path enumeration
• On Computing the Total Displacement Number via Weighted Motzkin Paths
• Motzkin numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Computing the Total Displacement Number via Weighted Motzkin Paths