On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees

DOI10.1007/978-3-030-44559-1_15OpenAlexW2948003280MaRDI QIDQ3387115

Prodinger, Helmut, Sarah J. Selkirk, Stephan G. Wagner

Publication date: 12 January 2021

Published in: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (7)

Generating functions for a lattice path model introduced by Deutsch ⋮ Raney numbers, threshold sequences and Motzkin-like paths ⋮ S-Motzkin paths with catastrophes and air pockets ⋮ Unnamed Item ⋮ On some problems about ternary paths: a linear algebra approach ⋮ An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths ⋮ A bijection between two subfamilies of Motzkin paths

Cites Work

• A bijective approach to the area of generalized Motzkin paths
• A simple bijection between a subclass of 2-binary trees and ternary trees
• Dyck path enumeration
• Bijections for ternary trees and non-crossing trees
• Diagonally convex directed polyominoes and even trees: A bijection and related issues
• 2-binary trees: bijections and related issues
• On the Number of ON Cells in Cellular Automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees