Number of Forts in Iterated Logistic Mapping
Keyword(s):
Using the theory of complete discrimination system and the computer algebra systemMAPLE V.17, we compute the number of forts for the logistic mappingfλ(x)=λx(1-x)on[0,1]parameterized byλ∈(0,4]. We prove that if0<λ≤2then the number of forts does not increase under iteration and that ifλ>2then the number of forts is not bounded under iteration. Furthermore, we focus on the case ofλ>2and give for eachk=1,…,7some critical values ofλfor the change of numbers of forts.
1998 ◽
Vol 37
(03)
◽
pp. 235-238
◽
2000 ◽
Vol 29
(1)
◽
pp. 83-94
◽
1995 ◽
Vol 10
(3)
◽
pp. 329-337
◽
2012 ◽
Vol 56
(1)
◽
pp. 139-144