Discrete map · 2D · dim 2
Gingerbreadman map
A piecewise-linear area-preserving 2D map whose iterates trace out a gingerbread-man silhouette around a regular pattern of fixed points.
Equations
x_{n+1} = 1 − y_n + |x_n|
y_{n+1} = x_nAt a glance
| Parameters | (no free parameter) |
|---|---|
| Chaotic for | always (mixed regular/chaotic phase space) |
| History | Devaney's 'introduction to chaotic dynamical systems' textbook. |
See also
Quick quiz
Test yourself on gingerbreadman
8 multiple-choice questions. Pick an answer for each, then submit to see explanations.
Q1.The gingerbreadman map x_{n+1} = 1 − y_n + |x_n|, y_{n+1} = x_n is:
Q2.The map's name comes from:
Q3.Number of fixed points of the gingerbreadman map:
Q4.Phase space of the gingerbreadman is:
Q5.Devaney popularised this map in:
Q6.The absolute-value term |x| makes the map:
Q7.Compared to Hénon, gingerbreadman is:
Q8.Iterates of the gingerbreadman seeded near the fixed points trace: