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

2020/12/02 by Prodinger, Helmut
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2012.01178

Abstract

S-Motzkin paths (bijective to ternary trees) and partial version of them are calculated using only elementary methods from linear algebra.

Related

• On two subclasses of Motzkin paths and their relation to ternary trees
• A bijection between two subfamilies of Motzkin paths
• A bijection between ternary trees and a subclass of Motzkin paths
• Grand Motzkin paths and \0,1,2\-trees -- a simple bijection
• Multi-edge trees and 3-coloured Motzkin paths: bijective issues