کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1713655 | 1013243 | 2010 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Counting paths on a chessboard with a barrier
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We are dealing with the problem of counting the paths joining two points of a chessboard in the presence of a barrier. The formula for counting all the paths joining two distinct positions on the chessboard lying always over a barrier is well known (see for example Feller (1968) [1], Kreher and Stinson (1999) [3]). The problem is here extended to the calculation of all the possible paths of nn movements which stay exactly kk times, 0≤k≤n+10≤k≤n+1, over the barrier. Such a problem, motivated by the study of financial options of Parisian type, is completely solved by virtue of five different formulas depending on the initial and final positions and on the level of the barrier.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Nonlinear Analysis: Hybrid Systems - Volume 4, Issue 3, August 2010, Pages 432–440
Journal: Nonlinear Analysis: Hybrid Systems - Volume 4, Issue 3, August 2010, Pages 432–440
نویسندگان
Marcellino Gaudenzi,