On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
From MaRDI portal
Publication:3387115
DOI10.1007/978-3-030-44559-1_15OpenAlexW2948003280MaRDI QIDQ3387115FDOQ3387115
Authors: Helmut Prodinger, Sarah J. Selkirk, Stephan 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
Cites Work
- Analytic combinatorics
- Title not available (Why is that?)
- Dyck path enumeration
- Title not available (Why is that?)
- Minimal and maximal plateau lengths in Motzkin paths
- A bijective approach to the area of generalized Motzkin paths
- Bijections for ternary trees and non-crossing trees
- 2-binary trees: bijections and related issues
- Diagonally convex directed polyominoes and even trees: A bijection and related issues
- A simple bijection between a subclass of 2-binary trees and ternary trees
- On the number of ON cells in cellular automata
Cited In (10)
- Generating functions for a lattice path model introduced by Deutsch
- On two subclasses of Motzkin paths and their relation to ternary trees
- On some problems about ternary paths: a linear algebra approach
- An online bin-packing problem with an underlying ternary structure
- On merge trees and discrete Morse functions on paths and trees
- Title not available (Why is that?)
- A bijection between two subfamilies of Motzkin paths
- Raney numbers, threshold sequences and Motzkin-like paths
- An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths
- S-Motzkin paths with catastrophes and air pockets
This page was built for publication: On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387115)
