Number of forts in iterated logistic mapping (Q1677691): Difference between revisions

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.