1. Dynamics of the family of complex maps Paul Blanchard Toni Garijo Matt Holzer Robert Kozma Dan Look Sebastian Marotta Mark Morabito with: Monica Moreno Rocha Kevin Pilgrim Elizabeth Russell Yakov Shapiro David Uminsky Sum Wun Ellce Sierpinski Galore

2. Sierpinski curves show up as Julia sets for many different parameters

3. A Sierpinski curve is any planar set that is homeomorphic to the Sierpinski carpet fractal. The Sierpinski Carpet Sierpinski Curve

4. Much of what we’ll see holds for the more general family where c is the center of a hyperbolic component of the Multibrot set

5. where c is the center of a hyperbolic component of the Multibrot set But for simplicity, we’ll concentrate for the most part on the easier family Much of what we’ll see holds for the more general family

6. Why the interest in these maps?

7. 1. These are singular perturbations of z n.

8. Why the interest in these maps? 1. These are singular perturbations of z n. When = 0, we completely understand the dynamics of z n, but when  0, the Julia set “explodes.”

9. 2. How do you solve the equation z 2 - = 0 ??? Why the interest in these maps? 1. These are singular perturbations of z n.

10. Why the interest in these maps? You use Newton’s method (of course!): 1. These are singular perturbations of z n. 2. How do you solve the equation z 2 - = 0 ???

11. Why the interest in these maps? Iterate: 1. These are singular perturbations of z n. 2. How do you solve the equation z 2 - = 0 ??? You use Newton’s method (of course!):

12. Why the interest in these maps? Iterate: a singular perturbation of z/2 1. These are singular perturbations of z n. 2. How do you solve the equation z 2 - = 0 ??? You use Newton’s method (of course!):

13. Why the interest in these maps? Whenever the equation has a multiple root, the corresponding Newton’s method involves a singular perturbation. 1. These are singular perturbations of z n. 2. How do you solve the equation z 2 - = 0 ??? You use Newton’s method (of course!):

14. Why the interest in these maps? 3. We are looking at maps on the boundary of the set of rational maps of degree 2n --- a very interesting topic of contemporary research. 1. These are singular perturbations of z n. 2. How do you solve the equation z 2 - = 0 ???

15. Why the interest in these maps? 3. We are looking at maps on the boundary of the set of rational maps of degree 2n --- a very interesting topic of contemporary research. 1. These are singular perturbations of z n. 2. How do you solve the equation z 2 - = 0 ??? 4.And like the quadratic and exponential families, and despite the high degree of these maps, there is only one free critical orbit for these maps.

16. Dynamics of complex and The Julia set is: The closure of the set of repelling periodic points; The boundary of the escaping orbits; The chaotic set. The Fatou set is the complement of. A rational map of degree 2n.

17. When, the Julia set is the unit circle

18. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

19. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

20. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

21. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

22. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

23. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

24. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

25. When, the Julia set is the unit circle Colored points have orbits that escape to infinity: Escape time: red (fastest) orange yellow green blue violet (slowest)

26. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

27. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

28. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

29. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

30. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

31. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

32. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

33. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

34. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

35. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

36. When, the Julia set is the unit circle Black points have orbits that do not escape to infinity:

37. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

38. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

39. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

40. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

41. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

42. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

43. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

44. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

45. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

46. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

47. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

48. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

49. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

50. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

51. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

52. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

53. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

54. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

55. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

56. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

57. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

58. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

59. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

60. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

61. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

62. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

63. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

64. When, the Julia set is the unit circle The Julia set is the boundary of the black & colored regions.

65. But when, the Julia set explodes When, the Julia set is the unit circle

66. But when, the Julia set explodes A Sierpinski curve When, the Julia set is the unit circle

67. But when, the Julia set explodes Another Sierpinski curve When, the Julia set is the unit circle

68. But when, the Julia set explodes Also a Sierpinski curve When, the Julia set is the unit circle

69. Fourth reason this family is important:

70. 2n free critical points Easy computations:

71. 2n free critical points

72. Easy computations: 2n free critical points Only 2 critical values

73. Easy computations: 2n free critical points Only 2 critical values

74. Easy computations: 2n free critical points Only 2 critical values

75. Easy computations: 2n free critical points Only 2 critical values But really only 1 free critical orbit since the map has z  -z symmetry

76. Easy computations: is superattracting, so have immediate basin B mapped n-to-1 to itself. B

77. Easy computations: is superattracting, so have immediate basin B mapped n-to-1 to itself. B T 0 is a pole, so have trap door T mapped n-to-1 to B.

78. Easy computations: is superattracting, so have immediate basin B mapped n-to-1 to itself. B T So any orbit that eventually enters B must do so by passing through T. 0 is a pole, so have trap door T mapped n-to-1 to B.

79. The Escape Trichotomy There are three distinct ways the critical orbit can enter B: (with D. Look and D. Uminsky)

80. The Escape Trichotomy B is a Cantor set There are three distinct ways the critical orbit can enter B:

81. The Escape Trichotomy B is a Cantor set T is a Cantor set of simple closed curves There are three distinct ways the critical orbit can enter B: (this case does not occur if n = 2)

82. The Escape Trichotomy B is a Cantor set T is a Cantor set of simple closed curves T is a Sierpinski curve There are three distinct ways the critical orbit can enter B: (this case does not occur if n = 2)

83. B is a Cantor set parameter plane when n = 3 Case 1:

84. B is a Cantor set parameter plane when n = 3 J is a Cantor set

85. B is a Cantor set parameter plane when n = 3 J is a Cantor set

86. B is a Cantor set parameter plane when n = 3 J is a Cantor set

87. B is a Cantor set parameter plane when n = 3 J is a Cantor set

88. B is a Cantor set parameter plane when n = 3 J is a Cantor set

89. B is a Cantor set parameter plane when n = 3 J is a Cantor set

90. B is a Cantor set parameter plane when n = 3 J is a Cantor set

91. B is a Cantor set parameter plane when n = 3 J is a Cantor set

92. B is a Cantor set parameter plane when n = 3 J is a Cantor set

93. B is a Cantor set parameter plane when n = 3 J is a Cantor set

94. B is a Cantor set parameter plane when n = 3 J is a Cantor set

95. B is a Cantor set parameter plane when n = 3 J is a Cantor set

96. parameter plane when n = 3 Case 2: the critical values lie in T, not B

97. T parameter plane when n = 3 lies in the McMullen domain

98. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain Remark: There is no McMullen domain in the case n = 2.

99. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain

100. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain

101. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain

102. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain

103. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain

104. T parameter plane when n = 3 J is a Cantor set of simple closed curves lies in the McMullen domain

105. parameter plane when n = 3 Case 3: the critical orbits eventually reach T

106. T parameter plane when n = 3 lies in a Sierpinski hole

107. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

108. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

109. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

110. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

111. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

112. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

113. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

114. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

115. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

116. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

117. T parameter plane when n = 3 J is a Sierpinski curve lies in a Sierpinski hole

118. A Sierpinski curve is any planar set that is homeomorphic to the Sierpinski carpet fractal. The Sierpinski Carpet Three Reasons Why the Sierpinski Carpet Is the Most Important Planar Fractal

119. These sets occur over and over as Julia sets for these rational maps:

120. The Sierpinski Carpet Topological Characterization Any planar set that is: 1. compact 2. connected 3. locally connected 4. nowhere dense 5. any two complementary domains are bounded by simple closed curves that are pairwise disjoint is a Sierpinski curve.

121. Any planar, one-dimensional, compact, connected set can be homeomorphically embedded in a Sierpinski curve. More importantly.... A Sierpinski curve is a universal plane continuum: For example....

122. The topologist’s sine curve can be embedded inside

123. The topologist’s sine curve can be embedded inside

124. The topologist’s sine curve can be embedded inside

125. The Knaster continuum can be embedded inside

126. The Knaster continuum can be embedded inside

127. The Knaster continuum can be embedded inside

128. The Knaster continuum can be embedded inside

129. The Knaster continuum can be embedded inside

130. The Knaster continuum can be embedded inside

131. The Knaster continuum can be embedded inside

132. The Knaster continuum can be embedded inside

133. The Knaster continuum can be embedded inside

134. The Knaster continuum can be embedded inside

135. The Knaster continuum can be embedded inside

136. The Knaster continuum can be embedded inside

137. The Knaster continuum can be embedded inside

138. The Knaster continuum can be embedded inside

139. The Knaster continuum can be embedded inside

140. The Knaster continuum can be embedded inside

141. The Knaster continuum can be embedded inside

142. The Knaster continuum can be embedded inside

143. The Knaster continuum can be embedded inside

144. The Knaster continuum can be embedded inside

145. The Knaster continuum can be embedded inside

146. The Knaster continuum can be embedded inside

147. The Knaster continuum can be embedded inside

148. The Knaster continuum can be embedded inside

149. The Knaster continuum can be embedded inside

150. The Knaster continuum can be embedded inside

151. The Knaster continuum can be embedded inside

152. The Knaster continuum can be embedded inside

153. The Knaster continuum can be embedded inside

154. The Knaster continuum can be embedded inside

155. The Knaster continuum can be embedded inside

156. The Knaster continuum can be embedded inside

157. The Knaster continuum can be embedded inside

158. The Knaster continuum can be embedded inside

159. Even this “curve”

160. To show that is homeomorphic to

161. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s

162. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s Fatou set is the union of the preimages of B; all disjoint, open disks.

163. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s Fatou set is the union of the preimages of B; all disjoint, open disks.

164. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s If J contains an open set, then J = C.

165. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s If J contains an open set, then J = C.

166. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s All critical orbits escape, so the map is hyperbolic on J.

167. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s All critical orbits escape, so the map is hyperbolic on J.

168. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s J locally connected, so the boundaries are locally connected. Need to show they are s.c.c.’s. Can only meet at (preimages of) critical points, hence disjoint.

169. Need to show: compact connected nowhere dense locally connected bounded by disjoint s.c.c.’s So J is a Sierpinski curve.

170. Have an exact count of the number of Sierpinski holes: Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

171. Have an exact count of the number of Sierpinski holes: Reason: The equation reduces to a polynomial of degree (n-1)(2n) (k-3) ; and it can be shown that all the roots of this polynomial are distinct. So we have exactly that many “centers” of Sierpinski holes, i.e., parameters for which the critical points all land on 0 and then on ∞. Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

172. Have an exact count of the number of Sierpinski holes: n = 3 escape time 3 2 Sierpinski holes parameter plane n = 3 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

173. Have an exact count of the number of Sierpinski holes: n = 3 escape time 3 2 Sierpinski holes parameter plane n = 3 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

174. Have an exact count of the number of Sierpinski holes: n = 3 escape time 4 12 Sierpinski holes parameter plane n = 3 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

175. Have an exact count of the number of Sierpinski holes: n = 3 escape time 4 12 Sierpinski holes parameter plane n = 3 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

176. Have an exact count of the number of Sierpinski holes: n = 4 escape time 3 3 Sierpinski holes parameter plane n = 4 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

177. Have an exact count of the number of Sierpinski holes: n = 4 escape time 4 24 Sierpinski holes parameter plane n = 4 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

178. Have an exact count of the number of Sierpinski holes: n = 4 escape time 12 402,653,184 Sierpinski holes Sorry. I forgot to indicate their locations. parameter plane n = 4 Theorem: Given n, there are exactly (n-1)(2n) Sierpinski holes with escape time k. (k-3)

179. Given two Sierpinski curve Julia sets, when do we know that the dynamics on them are the same, i.e., the maps are conjugate on the Julia sets? Main Question: These sets are homeomorphic, but are the dynamics on them the same?

180. Only Julia sets drawn from Sierpinski holes that are symmetrically located with respect to z   2 z, where  is an (n -1) st root of unity or complex conjugation have the same dynamics (i.e., are topologically conjugate on the J-sets) Answer:

181. Theorem: For any n there are exactly (n-1) (2n) Sierpinski holes with escape time k. The number of distinct conjugacy classes is given by: k-3 a. (2n) when n is odd; k-3 b. (2n) /2 + 2 when n is even. k-3k-4 Only Julia sets drawn from Sierpinski holes that are symmetrically located with respect to z   2 z, where  is an (n -1) st root of unity or complex conjugation have the same dynamics (i.e., are topologically conjugate on the J-sets) Answer:

182. n = 3, escape time 4, 12 Sierpinski holes, but only six conjugacy classes conjugate centers:,

183. n = 3, escape time 4, 12 Sierpinski holes, but only six conjugacy classes conjugate centers:,

184. n = 3, escape time 4, 12 Sierpinski holes, but only six conjugacy classes conjugate centers:,

185. n = 3, escape time 4, 12 Sierpinski holes, but only six conjugacy classes conjugate centers:,

186. ,,,,,where n = 4, escape time 4, 24 Sierpinski holes, but only five conjugacy classes conjugate centers:

187. ,,,,,where n = 4, escape time 4, 24 Sierpinski holes, but only five conjugacy classes conjugate centers:

188. ,,,,,where n = 4, escape time 4, 24 Sierpinski holes, but only five conjugacy classes conjugate centers:

189. ,,,,,where n = 4, escape time 4, 24 Sierpinski holes, but only five conjugacy classes conjugate centers:

190. ,,,,,where n = 4, escape time 4, 24 Sierpinski holes, but only five conjugacy classes conjugate centers:

191. n = 4: 402,653,184 Sierpinski holes with escape time 12; 67,108,832 distinct conjugacy classes. Sorry. I again forgot to indicate their locations.

192. The case n = 2 vs. n > 2 Singular perturbations of z 2 + c Singular perturbations of z 3 + c A major application Websites Baby Mandelbrot sets

193. There are infinitely many copies of the Mandelbrot set in the parameter planes for these maps

194. So we see quadratic-like Julia sets in the dynamical plane

195. So we see quadratic-like Julia sets in the dynamical plane

196. So we see quadratic-like Julia sets in the dynamical plane

197. So we see quadratic-like Julia sets in the dynamical plane

198. So we see quadratic-like Julia sets in the dynamical plane

199. So we see quadratic-like Julia sets in the dynamical plane

200. But if the Mandelbrot sets are “buried”...

202. then the Julia sets from the main cardioid are again Sierpinski curves An attracting 3-cycle in the black regions

203. The case n = 2 is very different from (and much more difficult than) the case n > 2. n = 3 n = 2

204. One difference: there is a McMullen domain when n > 2, but no McMullen domain when n = 2 n = 3 n = 2

205. One difference: there is a McMullen domain when n > 2, but no McMullen domain when n = 2 n = 3 n = 2

206. There is lots of structure when n > 2, but what is going on when n = 2? n = 3 n = 2

207. There is lots of structure when n > 2, but what is going on when n = 2? n = 3 n = 2

208. There is lots of structure when n > 2, but what is going on when n = 2? n = 3 n = 2

209. Also, not much is happening for the Julia sets near 0 when n > 2 n = 3

210. The Julia set is always a Cantor set of circles. n = 3

211. The Julia set is always a Cantor set of circles.

212. The Julia set is always a Cantor set of circles. There is always a round annulus of some fixed width in the Fatou set, so the Julia set does not converge to the unit disk.

213. n = 2 But when n = 2, lots of things happen near the origin; in fact, the Julia sets converge to the unit disk as disk-converge

214. For the family the Julia sets again converge to the unit disk, but only if  0 along n - 1 special rays. (with M. Morabito) n = 6 n = 4

215. Consider the family of maps where c is the center of a hyperbolic component of the Mandelbrot set. c = 0

216. Consider the family of maps where c is the center of a hyperbolic component of the Mandelbrot set. c = -1

217. Consider the family of maps where c is the center of a hyperbolic component of the Mandelbrot set. c = -.12 +.75i

218. When, the Julia set again expodes and converges to the filled Julia set for z 2 + c. (with R. Kozma)

219. When, the Julia set again expodes and converges to the filled Julia set for z 2 + c. (with R. Kozma)

220. When, the Julia set again expodes and converges to the filled Julia set for z 2 + c. (with R. Kozma)

221. When, the Julia set again expodes and converges to the filled Julia set for z 2 + c. (with R. Kozma)

222. When, the Julia set again expodes and converges to the filled Julia set for z 2 + c. (with R. Kozma) An inverted Douady rabbit

223. If you chop off the “ears” of each internal rabbit in each component of the original Fatou set, then what’s left is another Sierpinski curve (provided that both of the critical orbits eventually escape).

224. The case n > 2 is also very different: (E. Russell)

225. When is small, the Julia set contains a Cantor set of “circles” surrounding the origin.....

226. infinitely many of which are “decorated” and there are also Cantor sets of buried points

227. Here’s the parameter plane when n = 2:

228. Rotate it by 90 degrees: You will win a Fiends Medal if you.....

229. ... help me figure out who this person is!

230. Paul Blanchard Toni Garijo Matt Holzer Robert Kozma Dan Look Sebastian Marotta Mark Morabito with: Monica Moreno Rocha Kevin Pilgrim Elizabeth Russell Yakov Shapiro David Uminsky Sum Wun Ellce

231. Paul Blanchard Toni Garijo Matt Holzer Robert Kozma Dan Look Sebastian Marotta Mark Morabito with: Monica Moreno Rocha Kevin Pilgrim Elizabeth Russell Yakov Shapiro David Uminsky Sum Wun Ellce

232. Paul Blanchard Toni Garijo Matt Holzer Robert Kozma Dan Look Sebastian Marotta Mark Morabito suspects: Monica Moreno Rocha Kevin Pilgrim Elizabeth Russell Yakov Shapiro David Uminsky Sum Wun Ellce

233. Websites: math.bu.edu/DYSYS Mandelbrot set Explorer java applets for quadratic polynomials exponentials, sines, etc. rational maps math.bu.edu/people/bob recent papers