کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1708528 | 1012826 | 2012 | 6 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The uplift principle for ordered trees
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مکانیک محاسباتی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper, we describe the uplift principle for ordered trees which lets us solve a variety of combinatorial problems in two simple steps. The first step is to find the appropriate generating function at the root of the tree, the second is to lift the result to an arbitrary vertex by multiplying by the leaf generating function. This paper, though self contained, is a companion piece to Cheon and Shapiro (2008) [2] though with many more possible applications. It also may be viewed as an invitation, via the symbolic method, to the authoritative 800 page book of Flajolet and Sedgewick (2009) [8]. Our examples, with one exception, are different from those in this excellent reference.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics Letters - Volume 25, Issue 6, June 2012, Pages 1010–1015
Journal: Applied Mathematics Letters - Volume 25, Issue 6, June 2012, Pages 1010–1015
نویسندگان
Gi-Sang Cheon, Louis Shapiro,