<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

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

Pure Mathematics and Applications

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

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....

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

Publié en ligne: 24 déc. 2020

Pages: 28 - 38

Reçu: 23 oct. 2019

Accepté: 30 sept. 2020

DOI: https://doi.org/10.1515/puma-2015-0039

Mots clés
ternary tree, S-Motzkin path, kernel method, generalised binomial series

© 2020 Helmut Prodinger, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

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

Publié en ligne: 24 déc. 2020

Pages: 28 - 38

Reçu: 23 oct. 2019

Accepté: 30 sept. 2020

DOI: https://doi.org/10.1515/puma-2015-0039

Mots clésternary tree, S-Motzkin path, kernel method, generalised binomial series

© 2020 Helmut Prodinger, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Mots clés
ternary tree, S-Motzkin path, kernel method, generalised binomial series