A First Course in Discrete Dynamical Systems [Paperback]

Given the ease with which computers can do iteration it is now possible for almost anyone to generate beautiful images whose roots lie in discrete dynamical systems. Images of Mandelbrot and Julia sets abound in publications both mathematical and not. The mathematics behind the pictures are beautiful in their own right and are the subject of this text. Mathematica programs that illustrate the dynamics are included in an appendix.

Discrete dynamical systems are essentially iterated functions. Given the ease with which computers can do iteration, it is now possible for anyone with access to a personal computer to generate beautiful images whose roots lie in discrete dynamical systems. Images of Mandelbrot and Julia sets abound in publications both mathematical and not. The mathematics behind the pictures are beautiful in their own right and are the subject of this text. The level of the presentation is suitable for advanced undergraduates with a year of calculus behind them. Students in the author's courses using this material have come from numerous disciplines; many have been majors in other disciplines who are taking mathematics courses out of general interest. Concepts from calculus are reviewed as necessary. Mathematica programs that illustrate the dynamics and that will aid the student in doing the exercises are included in an appendix.1.1. Phase Portraits.- Exercise Set 1.- A Quick Look at Functions.- Exercise Set 2.- The Topology of the Real Numbers.- Exercise Set 3.- Periodic Points and Stable Sets.- 4.1 Graphical Analysis.- Exercise Set 4.- Sarkovskii's Theorem.- Exercise Set 5.- Differentiability and Its Implications.- Exercise Set 6.- Parametrized Families of Functions and Bifurcations.- Exercise Set 7.- The Logistic Function Part I: Cantor Sets and Chaos.- 8.1. A First Look at the Logistic Function when r > 4.- 8.2. Cantor Sets.- 8.3. Chaos and the Dynamics of the Logistic Function.- 8.4. A Few Additional Comments on Cantor Sets.- Exel“Y