Number of forts in iterated logistic mapping
Summary: 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 \(f_\lambda(x) = \lambda x(1 - x)\) on \([0,1]\) parameterized by \(\lambda \in(0,4]\). We prove that if \(0 < \lambda \leq 2\) then the number of forts does not increase under iteration and that if \(\lambda > 2\) then the number of forts is not bounded under iteration. Furthermore, we focus on the case of \(\lambda > 2\) and give for each \(k = 1, \ldots, 7\) some critical values of \(\lambda\) for the change of numbers of forts.
- A complete discrimination system for polynomials
- Chaos
- Fibonacci order in the period-doubling cascade to chaos
- scientific article; zbMATH DE number 3840529 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- Period doubling, information entropy, and estimates for Feigenbaum's constants
- PM functions, their characteristic intervals and iterative roots
- Real polynomial iterative roots in the case of nonmonotonicity height 2
This page was built for publication: Number of forts in iterated logistic mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677691)
