Number of Forts in Iterated Logistic Mapping

Kaixuan Yu and Zhiheng Yu

Discrete Dynamics in Nature and Society, 2016, vol. 2016, 1-6

Abstract:

Using the theory of complete discrimination system and the computer algebra system MAPLE V.17 , we compute the number of forts for the logistic mapping on parameterized by . We prove that if then the number of forts does not increase under iteration and that if then the number of forts is not bounded under iteration. Furthermore, we focus on the case of and give for each some critical values of for the change of numbers of forts.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/DDNS/2016/4682168.pdf (application/pdf)
http://downloads.hindawi.com/journals/DDNS/2016/4682168.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:4682168

DOI: 10.1155/2016/4682168

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().