Open AccessA bijection between two subfamilies of Motzkin paths
Author(s) -
Nancy S. S. Gu,
Helmut Prodinger
Publication year - 2021
Publication title -
applicable analysis and discrete mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.69
H-Index - 26
eISSN - 2406-100X
pISSN - 1452-8630
DOI - 10.2298/aadm200707026g
Subject(s) - bijection , mathematics , ternary operation , combinatorics , construct (python library) , computer science , programming language
Two subfamilies of Motzkin paths, with the same numbers of up, down, horizontal steps were known to be equinumerous with ternary trees and related objects. We construct a bijection between these two families that does not use any auxiliary objects, like ternary trees.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom