| 词条 | 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 is known as the Menger sponge. ConstructionThe 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 most languages derived from C.{{dubious|date=May 2017|The SC is an infinite set in the real plane, something that no computer program can generate.}} /*
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} ProcessPropertiesThe area of the carpet is zero (in standard Lebesgue measure). Proof: Denote as {{mvar|ai}} the area of iteration {{mvar|i}}. Then {{math|ai + 1 {{=}} {{sfrac|8|9}}ai}}. So {{math|ai {{=}} ({{sfrac|8|9}}){{sup|i}}}}, which tends to 0 as {{mvar|i}} goes to infinity. The interior of the carpet is empty. Proof: Suppose by contradiction that there is a point {{mvar|P}} in the interior of the carpet. Then there is a square centered at {{mvar|P}} which is entirely contained in the carpet. This square contains a smaller square whose coordinates are multiples of {{math|{{sfrac|1|3k}}}} for some {{mvar|k}}. But, this square must have been holed in iteration {{mvar|k}}, so it cannot be contained in the carpet – a contradiction. The Hausdorff dimension of the carpet is {{math|{{sfrac|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 true 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 {{mvar|p}} for which some connected neighborhood {{mvar|U}} of {{mvar|p}} has the property that {{math|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 {{mvar|X}} is a continuum embedded in the plane. Suppose its complement in the plane has countably many connected components {{math|C1, C2, C3, ...}} and suppose:
Then {{mvar|X}} is homeomorphic to the Sierpinski carpet. Brownian motion on the Sierpinski carpetThe 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 {{math|{{sqrt|n}}}} after {{mvar|n}} steps, but the random walk on the discrete Sierpinski carpet reaches only a mean distance proportional to {{math|{{radic|n|β}}}} for some {{math|β > 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 sieveA 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 {{mvar|i}}th step by subdividing each square into {{math|(2i + 1)2}} (the odd squares[6]) smaller squares and removing the middle one. By the Wallis product, the area of the resulting set is {{sfrac|{{pi}}|4}},[7][8] 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. ApplicationsMobile 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. See also
References1. ^{{cite book | last1 = Allouche | first1 = Jean-Paul | last2 = Shallit | first2 = Jeffrey | author2-link = Jeffrey Shallit | isbn = 978-0-521-82332-6 | publisher = Cambridge University Press | title = Automatic Sequences: Theory, Applications, Generalizations | year = 2003 | zbl=1086.11015 | pages=405–406 }} 2. ^{{cite book | authorlink=Stephen Semmes | title=Some Novel Types of Fractal Geometry | series=Oxford Mathematical Monographs | publisher=Oxford University Press | year=2001 | isbn=0-19-850806-9 | zbl=0970.28001 | last=Semmes | first=Stephen | page=31 }} 3. ^{{cite journal | jfm=46.0295.02 | last=Sierpiński | first=Wacław | authorlink=Wacław Sierpiński | title=Sur une courbe cantorienne qui contient une image biunivoque et continue de toute courbe donnée | language=French | journal=C. R. Acad. Sci. Paris | volume=162 | pages=629–632 | year=1916 | issn=0001-4036 }} 4. ^{{cite journal | last=Whyburn | first=Gordon | authorlink=Gordon Whyburn | title=Topological chcracterization of the Sierpinski curve | journal=Fund. Math. | volume=45 | pages=320–324 | year=1958 }} 5. ^{{Citation|last1=Barlow|first1=Martin|last2=Bass|first2=Richard|title=Brownian motion and harmonic analysis on Sierpinski carpets|url=https://www.math.ubc.ca/~barlow/preprints/61_sch_pub.pdf}} 6. ^{{Cite OEIS |A016754 |Odd squares: a(n) {{=}} (2n+1)^2. Also centered octagonal numbers.}} 7. ^{{cite journal | last = Rummler | first = Hansklaus | doi = 10.2307/2324662 | issue = 9 | journal = The American Mathematical Monthly | mr = 1247533 | pages = 858–860 | title = Squaring the circle with holes | volume = 100 | year = 1993}} 8. ^{{mathworld|id=WallisSieve|title=Wallis Sieve}} External links{{Commons|Sierpinski carpet}}
4 : Iterated function system fractals|Curves|Topological spaces|Science and technology in Poland |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。