کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1147702 957787 2011 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Counting strings at height j in Dyck paths
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
Counting strings at height j in Dyck paths
چکیده انگلیسی

Let ττ be an arbitrary lattice path, called in this context string, consisting of two kinds of steps (rises and falls) and let j be a non-negative integer.In this paper, the explicit formula for the generating function Fj associated with the Dyck path statistic “number of occurrences of ττ at height j” is evaluated.For the expression of Fj some basic characteristics of the string are used, namely its number of rises, height, depth and periodicity, as well as the generating function of the Catalan numbers.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Statistical Planning and Inference - Volume 141, Issue 6, June 2011, Pages 2100–2107
نویسندگان
, , , ,