2000 character limit reached
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths
Published 2 Apr 2021 in math.CO and cs.DM | (2104.01186v2)
Abstract: In this note, we present constructive bijections from Dyck and Motzkin meanders with catastrophes to Dyck paths avoiding some patterns. As a byproduct, we deduce correspondences from Dyck and Motzkin excursions to restricted Dyck paths.
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.
