Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach

Prodinger, Helmut

doi:10.1515/puma-2015-0039

.blurhash-client-img { display: none !important; }

Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach

Pure Mathematics and Applications

Volume 29 (2020): Issue 1 (December 2020)

By: Helmut Prodinger

Open Access

|Dec 2020

Abstract

The area of S-Motzkin paths (bijective to ternary trees) is calculated using the kernel method by enumerating these (partial) paths with fixed end-point resp. starting point.

References

[1] C. Banderier and B. Gittenberger, Analytic combinatorics of lattice paths: enumeration and asymptotics for the area, Discrete Math. Theor. Comput. Sci. Proc., AG (2006) 345–355.
Search in Google Scholar Back to article
[2] P. Flajolet and R. Sedgewick, Analytic Combinatorics, Cambridge University Press, 2009.10.1017/CBO9780511801655
Search in Google Scholar Back to article
[3] I. M. Gessel and G. Xin, The generating function of ternary trees and continued fractions, Electron. J. Combin., 13 (2006) #R53, 48 pp.10.37236/1079
Search in Google Scholar Back to article
[4] H. Gould, The Girard-Waring power sum formulas for symmetric functions and Fibonacci sequences, Fibonacci Quart., 37 (1999) 135–140.
Search in Google Scholar Back to article
[5] R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1999.
Search in Google Scholar Back to article
[6] C. Krattenthaler, Lattice path enumeration, in: Handbook of enumerative combinatorics, Discrete Math. Appl. (Boca Raton), pp. 589–678. CRC Press, Boca Raton, FL, 2015.
Search in Google Scholar Back to article
[7] H. Mularczyk, Lattice paths and pattern-avoiding uniquely sorted permutations, at https://arxiv.org/abs/1908.04025.
Search in Google Scholar Back to article
[8] E. Pergola, Two bijections for the area of Dyck paths, Discrete Math., 241 (2001) 435–447.
Search in Google Scholar Back to article
[9] E. Pergola, R. Pinzani, S. Rinaldi and R. A. SulankeA bijective approach to the area of generalized Motzkin paths, Adv. in Appl. Math., 28 (2002) 580–591.
Search in Google Scholar Back to article
[10] F. Petrov and A. Vershik, International mathematics competition: Day 2 problem 8, at /imc-math.ddns.net/pdf/imc2018-day2-questions.pdf.
Search in Google Scholar Back to article
[11] H. Prodinger, S. J. Selkirk and S. Wagner, On two subclasses of Motzkin paths and their relation to ternary trees, in: V. Pillwein and C. Schneider (Eds.), Algorithmic Combinatorics – Enumerative Combinatorics, Special Functions and Computer Algebra in honour of Peter Paule on his 60th birthday, Springer, 2020, pp. 297–316.10.1007/978-3-030-44559-1_15
Search in Google Scholar Back to article
[12] R. Vidunas, A generalization of Clausen’s identity, Ramanujan J., 26 (2011) 133–146.
Search in Google Scholar Back to article

DOI: https://doi.org/10.1515/puma-2015-0039 | Journal eISSN: 1788-800X

Journal RSS Feed

Language: English

Page range: 28 - 38

Submitted on: Oct 23, 2019

Accepted on: Sep 30, 2020

Published on: Dec 24, 2020

Published by: Corvinus University of Budapest

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

ternary tree,

S-Motzkin path,

kernel method,

generalised binomial series

Related subjects:

Computer sciences,

Theoretical computer sciences,

Business and economics,

Mathematics and statistics for economists,

Mathematics,

Analysis,

Differential equations and dynamical systems

© 2020 Helmut Prodinger, published by Corvinus University of Budapest
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous article Volume 29 (2020): Issue 1 (December 2020)