<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

Pubblicato online: 24 dic 2020

Pagine: 28 - 38

Ricevuto: 23 ott 2019

Accettato: 30 set 2020

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

Parole chiave
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

Pubblicato online: 24 dic 2020

Pagine: 28 - 38

Ricevuto: 23 ott 2019

Accettato: 30 set 2020

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

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

Parole chiave
ternary tree, S-Motzkin path, kernel method, generalised binomial series