Abstract
Discrete self-similar fractals have been studied as test cases for self-assembly ever since Winfree exhibited a tile assembly system in which the Sierpinski triangle self-assembles. For strict self-assembly, where tiles are not allowed to be placed outside the target structure, it is an open question whether any self-similar fractal can self-assemble. This has motivated the development of techniques to approximate fractals with strict self-assembly. Ideally, such an approximation would produce a structure with the same fractal dimension as the intended fractal and with specially labeled tiles at positions corresponding to points in the fractal. We show that the Sierpinski carpet, along with an infinite class of related fractals, can approximately self-assemble in this manner. Our construction takes a set of parameters specifying a target fractal and creates a tile assembly system in which the fractal approximately self-assembles. This construction introduces rulers and readers to control the self-assembly of a fractal structure without distorting it. To verify the fractal dimension of the resulting assemblies, we prove a result on the dimension of sets embedded into discrete fractals. We also give a conjecture on the limitations of approximating self-similar fractals.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L., Cheng, Q., Goel, A., Huang, M.: Running time and program size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (2001)
Carbone, A., Seeman, N.C.: A route to fractal DNA-assembly. Natural Computing 1, 469–480 (2002)
Carbone, A., Seeman, N.C.: Coding and geometrical shapes in nanostructures: a fractal DNA-assembly. Natural Computing 2, 133–151 (2003)
Cheng, Q., Goel, A., Moisset, P.: Optimal self-assembly of counters at temperature two. In: Proceedings of the 1st Conference on Foundations of Nanoscience: Self-Assembled Architectures and Devices (2004)
Doty, D., Gu, X., Lutz, J.H., Mayordomo, E., Moser, P.: Zeta-dimension. In: Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (2005)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1994)
Kautz, S.M., Lathrop, J.I.: Self-assembly of the Sierpinski carpet and related fractals. In: Proceedings of DNA15 (2009)
Kautz, S.M., Shutters, B.: Supplementary materials, www.cs.iastate.edu/~shutters/saragsc
Lathrop, J.I., Lutz, J.H., Summers, S.M.: Strict self-assembly of discrete Sierpinski triangles. Theoretical Computer Science 410, 384–405 (2009)
Lutz, J.H., Shutters, B.: Approximate self-assembly of the Sierpinski triangle. In: Proceedings of the 6th Conference on Computability in Europe (2010)
Patitz, M.J.: Simulation of self-assembly in the abstract tile assembly model with ISU TAS. In: Proceedings of the 6th Annual Conference on Foundations of Nanoscience (2009)
Patitz, M.J., Summers, S.M.: Self-assembly of discrete self-similar fractals. Natural Computing 9, 135–172 (2010)
Razpet, M.: The lucas property of a number array. Discrete Mathematics 248, 157–168 (2002)
Rothemund, P.W.K., Papadakis, N., Winfree, E.: Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biology 2(12) (2004)
Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (2000)
Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-Assembly. PhD thesis, University of Southern California, Los Angeles, California (2001)
Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal on Computing 36, 1544–1569 (2007)
Wang, H.: Dominoes and the AEA case of the decision problem. In: Proceedings of the Symposium on Mathematical Theory of Automata (1962)
Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology, Pasadena, California (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kautz, S.M., Shutters, B. (2011). Self-assembling Rulers for Approximating Generalized Sierpinski Carpets. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)