arXiv:2012.01178 [math.CO]AbstractReferencesReviewsResources An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths Helmut Prodinger Published 2020-12-02Version 1 S-Motzkin paths (bijective to ternary trees) and partial version of them are calculated using only elementary methods from linear algebra. Categories: math.CO Keywords: s-motzkin paths, elementary approach, recursions relative, enumeration, ternary trees Related articles: Most relevant | Search more arXiv:math/0609475 [math.CO] (Published 2006-09-17) Enumeration of subtrees of trees Weigen Yan, Yeong-Nan Yeh arXiv:math/0008209 [math.CO] (Published 2000-08-28) Enumeration of chord diagrams Andrei Khruzin arXiv:math/9904150 [math.CO] (Published 1999-04-27, updated 1999-04-28) Enumeration of Matchings: Problems and Progress James Propp Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:2012.01178 [math.CO]](http://oss.arxitics.com/images/favicon.svg)