Larry Riddle, Agnes Scott College

Fractals

The pattern for a symmetric Sierpinski relative fractal can be described by showing the location of the subsquare that is removed from each square, which we color as black. For the fractal to be symmetric with respect to the diagonal, these three black squares must be symmetrically located with respect to the diagonal. For the lower left square there are only two possible locations for the black subsquare, either in the lower left or the upper right corner.

In the upper left square, the black square can be placed in any of the four corners. Once that choice is made, however, the location of the black square in the lower right square must be chosen in a way to maintain the symmetry with respect to the diagonal. There are therefore 2x4 = 8 possible choices for locating the black squares. These are shown below. Click on any of the images to toggle between the pattern and the corresponding fractal image.

Now as long as another transformation that is applied to a square does not change the location of the black square, the attractor will not change. For each pattern above, there are two allowable transformations for each of the three squares that will preserve the symmetry. One of these transformations is the identity. The other is either 7 or 8, the reflections across the diagonals of a square.
Which reflection is allowed for a square depends on the location of the black subsquare in that square. For example, in the pattern

the possible transformations are {1,8} for the upper left square, {1,7} for the lower left square, and {1,8} for the lower right square. There are therefore 8 different 3-digit sequences that will leave the black squares in this pattern in the same location and thus produce the same fractal. These are shown below.

The same is true for each of the other 7 symmetric patterns. This accounts for 64 of the 512 possible 3-digit sequences.

Fractals

The remaining 448 possible 3-digit sequences correspond to Sierpinski relatives that do not exhibit any symmetry. They do, however, come in pairs in which each member of the pair is symmetric to the other with respect to the diagonal. If one member of the pair is given by the sequence (a,b,c), then the other member is given by the sequence (7•c•7, 7•b•7, 7•a•7), where 7•w•7 is the product (read right to left) in the dihedral group for the symmetries of the square.

To get a sense of why this works, first note that in reflecting the pattern across the diagonal, the upper left and lower right squares will trade places. This is why the order of the sequence is reversed. Second, if F represents the iterated function system for the pattern (a,b,c) and if A is the attractor for that IFS, then T_{7}(A) would represent the diagonal reflection of A, where T_{7} is the transformation corresponding to the diagonal reflection. Since F(A) = A and T_{7}T_{7} is the identity transformation, we would have

T_{7}FT_{7}(T_{7}(A)) = T_{7}F(A) = T_{7}(A).

This shows that T_{7}(A) is the attractor (fixed point) for the IFS given by T_{7}FT_{7}.

According to the dihedral group multiplication table, we have

7•1•7 = 1

7•2•7 = 4

7•3•7 = 3

7•4•7 = 2

7•5•7 = 6

7•6•7 = 5

7•7•7 = 7

7•8•7 = 8

So for example, if we start with the sequence 627, its symmetric counterpart would be 745. These patterns and corresponding fractals are shown below.

627

745

Since the non-symmetric fractals can be grouped into pairs, there are essentially 224 different non-symmetric Sierpinski relative fractals. Below are examples of 8 such fractals, done in counted cross-stitch.

Larry Riddle, 2011

Sierpinski Theme and Variations

(7 iterations on 25 count per inch fabric, 13.5" x 13.5")

Click on each picture for a larger view.

See a Gallery of all 232 fractals.

- Heinz-Otto Peitgen, Hartmut Jurgens, and Dietmar Saupe.
*Chaos and Fractals: New Frontiers of Science*, 2nd Edition, Springer-Verlag, 2004 , pp230-237 (pp244-251 in the 1992 first edition).