کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4655441 | 1343384 | 2013 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Alternating mapping functions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We consider functions f from [n]:={1,2,â¦,n} into itself satisfying that the labels along the iteration orbit of each iâ[n] are forming an alternating sequence, i.e., if2(i)⯠or i>f(i)f3(i)<â¯â. We are able to solve the enumeration problem by stating exact and asymptotic formulæ for the number of such so-called alternating n-mapping functions. Furthermore we study the expected component structure of a randomly chosen alternating n-mapping by determining the probability that the underlying mapping graph is connected as well as the limiting distribution of the number of components. Moreover, the corresponding enumeration problem for weakly alternating n-mapping functions has also been solved.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series A - Volume 120, Issue 7, September 2013, Pages 1835-1850
Journal: Journal of Combinatorial Theory, Series A - Volume 120, Issue 7, September 2013, Pages 1835-1850
نویسندگان
Alois Panholzer,