An algorithm for counting the number of periodic points of a family of polynomials
سال انتشار: 1403
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 36
فایل این مقاله در 19 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JDMA-9-4_001
تاریخ نمایه سازی: 14 آذر 1403
چکیده مقاله:
In this paper we consider the family fa(x) = axd(x − ۱) + x whena < ۰ is a real number and d ≥ ۲ is an even integer. The function fa has aunique positive critical point. By decreasing the parameter a, the behavior ofthe orbit of this critical point changes. In this paper we consider two cases. Inthe first case the orbit of the positive critical point converges to ۰ and in thesecond case the positive critical point is mapped to a repelling periodic pointof period ۲. In each case we give a recursive formula to determine the numberof the periodic points of fa. Also, in each case we introduce an invariant seton which fa is chaotic. We employ conjugacy map and symbolic dynamics inour investigations.
کلیدواژه ها:
نویسندگان
Monireh Akbari
Department of Mathematics, Faculty of Basic Sciences, Shahid Rajaee Teacher Training University, Tehran, Iran
Maryam Rabii
Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University,Tehran, Iran