An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths

DOI10.1080/10236198.2021.1944123zbMath1475.05011arXiv2012.01178OpenAlexW3176166887MaRDI QIDQ5156100

Prodinger, Helmut

Publication date: 14 October 2021

Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Motzkin pathsCramer's rulethird-order recursion

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (1)

A new statistic on Dyck paths for counting 3-dimensional Catalan words

Uses Software

• gfun
• OEIS

Cites Work

• Unnamed Item
• On some problems about ternary paths: a linear algebra approach
• The On-Line Encyclopedia of Integer Sequences
• On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
• GFUN
• Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach

This page was built for publication: An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths