n-flake

Abstract: In this paper, we construct the evolving networks from Sierpinski carpet, using the encoding approach in fractal geometry. We consider the small similar copies of unit square as nodes of network, where two nodes are neighbors if and only if their corresponding copies have common surface. For our networks, we check their scale-free and small-world effect by the self-similar structures, the exponent of power-law on degree distribution is log 3 8 which is the Hausdorff dimension of the carpet.

Abstract: Winfree (1998) showed that discrete Sierpinski triangles can self-assemble in the Tile Assembly Model. A striking molecular realization of this self-assembly, using DNA tiles a few nanometers long and verifying the results by atomic-force microscopy, was achieved by Rothemund, Papadakis, and Winfree (2004). Precisely speaking, the above self-assemblies tile completely filled-in, two-dimensional regions of the plane, with labeled subsets of these tiles representing discrete Sierpinski triangles. This paper addresses the more challenging problem of the strict self-assemblyof discrete Sierpinski triangles, i.e., the task of tiling a discrete Sierpinski triangle and nothing else. We first prove that the standard discrete Sierpinski triangle cannotstrictly self-assemble in the Tile Assembly Model. We then define the fibered Sierpinski triangle, a discrete Sierpinski triangle with the same fractal dimension as the standard one but with thin fibers that can carry data, and show that the fibered Sierpinski triangle strictly self-assembles in the Tile Assembly Model. In contrast with the simple XOR algorithm of the earlier, non-strict self-assemblies, our strict self-assembly algorithm makes extensive, recursive use of Winfree counters, coupled with measured delay and corner-turning operations. We verify our strict self-assembly using the local determinism method of Soloveichik and Winfree (2005).

Abstract: We consider a fractal with a variable fractal dimension, which is a generalization of the well known triadic Cantor set. In contrast with the usual Cantor set, the fractal dimension is controlled using a scaling factor, and can vary from zero to one in one dimension and from zero to three in three dimensions. The intensity profile of small-angle scattering from the generalized Cantor fractal in three dimensions is calculated. The system is generated by a set of iterative rules, each iteration corresponding to a certain fractal generation. Small-angle scattering is considered from monodispersive sets, which are randomly oriented and placed. The scattering intensities represent minima and maxima superimposed on a power law decay, with the exponent equal to the fractal dimension of the scatterer, but the minima and maxima are damped with increasing polydispersity of the fractal sets. It is shown that for a finite generation of the fractal, the exponent changes at sufficiently large wave vectors from the fractal dimension to four, the value given by the usual Porod law. It is shown that the number of particles of which the fractal is composed can be estimated from the value of the boundary between the fractal and Porod regions. The radius of gyration of the fractal is calculated analytically.