plan de l'intro

[rairo15.git] / chaos.tex

diff --git a/chaos.tex b/chaos.tex
index 91b8717f107e292c4928b2a63fd622494c312bcf..569d44a4508364b83f9b00488616041a6925931f 100644 (file)
--- a/chaos.tex
+++ b/chaos.tex
@@ -524,3 +524,9 @@ and only if its iteration graph $\Gamma_{\mathcal{P}}(f)$ is strongly connected.
   If $b$ is even, any vertex $e$ of $\Gamma_{\{b\}}(f_0)$ cannot reach itself 
   and thus $\Gamma_{\{b\}}(f_0)$ is not strongly connected.
 \end{proof}
   If $b$ is even, any vertex $e$ of $\Gamma_{\{b\}}(f_0)$ cannot reach itself 
   and thus $\Gamma_{\{b\}}(f_0)$ is not strongly connected.
 \end{proof}

+
+The next section shows how to generate functions and a iteration number $b$
+such that $\Gamma_{\{b\}}$ is strongly connected.
+
+
+ 
\ No newline at end of file