The
For both graphs, note each bin on the bottom of the unit square goes to a union of complete bins on the side of the square. For the logistic map L(X), note
L(bin1) = bin1 U bin2 U bin3 |
L(bin2) = bin4 |
L(bin3) = bin4 |
L(bin4) = bin1 U bin2 U bin3 |
and for the tent map T(x)
T(bin1) = bin1 U bin2 |
T(bin2) = bin3 U bin4 |
T(bin3) = bin3 U bin4 |
T(bin4) = bin1 U bin2 |
This relation between graphs and bins is called a Markov partition of the trapping square. For a Markov partition, the driven IFS is always determined by its empty length 2 subsquares. In this way, these are the simplest of driven IFS. One way to measure the complexity of a dynamical process is to find the smallest collection of empty subsquares needed to generate the driven IFS. This "grammatical complexity" of processes is an area of considerable research.
Return to Logistic and Tent IFS