Sierpinski carpet

6 steps of the Sierpinski carpet.

The Sierpinski carpet is a plane fractal first described by Wacław Sierpiński in 1916. The carpet is one generalization of the Cantor set to two dimensions; another is the Cantor dust.

The technique of subdividing a shape into smaller copies of itself, removing one or more copies, and continuing recursively can be extended to other shapes. For instance, subdividing an equilateral triangle into four equilateral triangles, removing the middle triangle, and recursing leads to the Sierpinski triangle. In three dimensions, a similar construction based on cubes produces the Sierpinski sponge and the Menger sponge.

Construction

The construction of the Sierpinski carpet begins with a square. The square is cut into 9 congruent subsquares in a 3-by-3 grid, and the central subsquare is removed. The same procedure is then applied recursively to the remaining 8 subsquares, ad infinitum. It can be realised as the set of points in the unit square whose coordinates written in base three do not both have a digit '1' in the same position.^[1]

The process of recursively removing squares is an example of a finite subdivision rule.

The Sierpinski carpet can also be created by iterating every pixel in a square and using the following algorithm to decide if the pixel is filled. The following implementation is valid C, C++, and Java.

/**
* Decides if a point at a specific location is filled or not.  This works by iteration first checking if
* the pixel is unfilled in successively larger squares or cannot be in the center of any larger square.
* @param x is the x coordinate of the point being checked with zero being the first pixel
* @param y is the y coordinate of the point being checked with zero being the first pixel
* @return 1 if it is to be filled or 0 if it is open
*/
int isSierpinskiCarpetPixelFilled(int x, int y)
{
    while(x>0 || y>0) // when either of these reaches zero the pixel is determined to be on the edge 
                               // at that square level and must be filled
    {
        if(x%3==1 && y%3==1) //checks if the pixel is in the center for the current square level
            return 0;
        x /= 3; //x and y are decremented to check the next larger square level
        y /= 3;
    }
    return 1; // if all possible square levels are checked and the pixel is not determined 
                   // to be open it must be filled
}

Process

Properties

The area of the carpet is zero (in standard Lebesgue measure). Proof: Denote by a_i the area of iteration i. Then a_i+1= ⁸⁄₉⋅a_i. So a_i=( ⁸⁄₉)ⁱ, which tends to 0 as i goes to infinity.

The interior of the carpet is empty. Proof: Suppose by contradiction that there is a point P in the interior of the carpet. Then there is a square centered at P which is entirely contained in the carpet. This square contains a smaller square whose coordinates are multiples of ¹⁄_3^k for some k. But, this square must have been holed in iteration k, so it can't be contained in the carpet - a contradiction.

The Hausdorff dimension of the carpet is log 8/log 3 ≈ 1.8928.^[2]

Sierpiński demonstrated that his carpet is a universal plane curve.^[3] That is: the Sierpinski carpet is a compact subset of the plane with Lebesgue covering dimension 1, and every subset of the plane with these properties is homeomorphic to some subset of the Sierpinski carpet.

This 'universality' of the Sierpinski carpet is not a universal property in the sense of category theory: it does not uniquely characterize this space up to homeomorphism. For example, the disjoint union of a Sierpinski carpet and a circle is also a universal plane curve. However, in 1958 Gordon Whyburn^[4] uniquely characterized the Sierpinski carpet as follows: any curve that is locally connected and has no 'local cut-points' is homeomorphic to the Sierpinski carpet. Here a local cut-point is a point p for which some connected neighborhood U of p has the property that U - {p} is not connected. So, for example, any point of the circle is a local cut point.

In the same paper Whyburn gave another characterization of the Sierpinski carpet. Recall that a continuum is a nonempty connected compact metric space. Suppose X is a continuum embedded in the plane. Suppose its complement in the plane has countably many connected components $C_{1},C_{2},C_{3},\dots$ and suppose:

the diameter of $C_{i}$ goes to zero as $i\to \infty$ ;
the boundary of $C_{i}$ and the boundary of $C_{j}$ are disjoint if $i\neq j$ ;
the boundary of $C_{i}$ is a simple closed curve for each $i$ ;
the union of the boundaries of the sets $C_{i}$ is dense in X.

Then X is homeomorphic to the Sierpinski carpet.

Brownian motion on the Sierpinski carpet

The topic of Brownian motion on the Sierpinski carpet has attracted interest in recent years.^[5] Martin Barlow and Richard Bass have shown that a random walk on the Sierpinski carpet diffuses at a slower rate than an unrestricted random walk in the plane. The latter reaches a mean distance proportional to n^1/2 after n steps, but the random walk on the discrete Sierpinski carpet reaches only a mean distance proportional to n^1/β for some β > 2. They also showed that this random walk satisfies stronger large deviation inequalities (so called "sub-gaussian inequalities") and that it satisfies the elliptic Harnack inequality without satisfying the parabolic one. The existence of such an example was an open problem for many years.

Wallis sieve

A variation of the Sierpinski carpet, called the Wallis sieve, starts in the same way, by subdividing the unit square into nine smaller squares and removing the middle of them. At the next level of subdivision, it subdivides each of the squares into 25 smaller squares and removes the middle one, and it continues at the ith step by subdividing each square into (2i + 1)² smaller squares and removing the middle one.

By the Wallis product, the area of the resulting set is π/4,^[6]^[7] unlike the standard Sierpinski carpet which has zero limiting area.

However, by the results of Whyburn mentioned above, we can see that the Wallis sieve is homeomorphic to the Sierpinski carpet. In particular, its interior is still empty.

Applications

Mobile phone and WiFi fractal antennas have been produced in the form of few iterations of the Sierpinski carpet. Due to their self-similarity and scale invariance, they easily accommodate multiple frequencies. They are also easy to fabricate and smaller than conventional antennas of similar performance, thus being optimal for pocket-sized mobile phones.

References

↑ Allouche, Jean-Paul; Shallit, Jeffrey (2003). Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press. pp. 405–406. ISBN 978-0-521-82332-6. Zbl 1086.11015.
↑ Semmes, Stephen (2001). Some Novel Types of Fractal Geometry. Oxford Mathematical Monographs. Oxford University Press. p. 31. ISBN 0-19-850806-9. Zbl 0970.28001.
↑ Sierpiński, Wacław (1916). "Sur une courbe cantorienne qui contient une image biunivoque et continue de toute courbe donnée". C. r. hebd. Seanc. Acad. Sci., Paris (in French). 162: 629–632. ISSN 0001-4036. JFM 46.0295.02.
↑ Whyburn, Gordon (1958). "Topological chcracterization of the Sierpinski curve". Fund. Math. 45: 320–324.
↑ Barlow, Martin; Bass, Richard, Brownian motion and harmonic analysis on Sierpinski carpets (PDF)
↑ Rummler, Hansklaus (1993), "Squaring the circle with holes", The American Mathematical Monthly, 100 (9): 858–860, doi:10.2307/2324662, MR 1247533 .
↑ Weisstein, Eric W. "Wallis Sieve". MathWorld.

External links

Wikimedia Commons has media related to Sierpinski carpet.

Fractals

Characteristics	Fractal dimensions Assouad Box-counting Correlation Hausdorff Packing Topological Recursion Self-similarity

Iterated function system	Barnsley fern Cantor set Dragon curve Koch snowflake Menger sponge Sierpinski carpet Sierpinski triangle Space-filling curve T-square

Strange attractor	Multifractal system

L-system	Space-filling curve

Escape-time fractals	Burning Ship fractal Julia set Filled Lyapunov fractal Mandelbrot set Nova fractal

Random fractals	Brownian motion Brownian tree Diffusion-limited aggregation Fractal landscape Lévy flight Percolation theory Self-avoiding walk

People	Georg Cantor Felix Hausdorff Gaston Julia Helge von Koch Paul Lévy Aleksandr Lyapunov Benoit Mandelbrot Lewis Fry Richardson Wacław Sierpiński

Other	"How Long Is the Coast of Britain?" Coastline paradox List of fractals by Hausdorff dimension The Beauty of Fractals (1986 book)

This article is issued from Wikipedia - version of the 8/21/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.