کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6871118 | 1440179 | 2018 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On rational Dyck paths and the enumeration of factor-free Dyck words
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by factor-free words. This bijection leads to a new statistic based on the reducibility level of the paths for which we provide a corresponding formula. On the other hand, we prove an inverse relation for certain sequences defined via partial Bell polynomials, and we use it to derive a formula for the enumeration of factor-free words. In addition, we give alternative formulas for various enumerative sequences that appear in the context of rational Dyck paths.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 244, 31 July 2018, Pages 36-43
Journal: Discrete Applied Mathematics - Volume 244, 31 July 2018, Pages 36-43
نویسندگان
Daniel Birmajer, Juan B. Gil, Michael D. Weiner,