Homework 10
Math 323, Fall 2014
Due Date: Friday, December 5
Consider the fractal subset of [0, 1] × [0, 1] defined by the following iterated function system:
1 1
x, y
2 2
1 1
1
x+ , y
2
2 2
1 1
1
x, y +
2 2
2
1 1
1
1
x+ , y+
4
4 4
4
F1 (x, y) =
F2 (x, y) =
F3 (x, y) =
F4 (x, y) =
Our goal is to determine the box-counting dimension of this fractal.
1. Let B(n) denote the number of boxes in an n × n grid that contain a point of this fractal. For
example, B(2) = 3 and B(4) = 10. What is B(8)?
2. Write a Mathematica notebook to determine the value of B(n) for n = 16, 32, 64, and 128. I
suggest the following procedure:
• First, compute at least 200,000 random points on the fractal.
• Next, use the BinCounts command to tally the number of points in each box.
• Finally, count the number of boxes containing at least one point from the fractal.
Make sure to test that your code works for the data points mentioned in problem 1.
3. The quantity B(n) should obey a power law of the form
B(n) ≈ Cnd ,
or equivalently
log B(n) ≈ (log C) + d(log n),
where d is the box-counting dimension.
(a) Use the Mathematica to make a log-log plot of the data you have collected.
(b) Use the LinearModelFit command to fit the log-log data points to a linear function.
Use only the four data points you found in problem 2.
(c) Make a plot showing the data points together with the linear regression line.
(d) What is the (approximate) box-counting dimension of this fractal?