2000 character limit reached
A bijection between two subfamilies of Motzkin paths
Published 4 Jul 2020 in math.CO | (2007.02142v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.