Self-assembly of discrete self-similar fractals
From MaRDI portal
Publication:968403
DOI10.1007/S11047-009-9147-7zbMATH Open1204.28016arXiv0803.1672OpenAlexW2951936407MaRDI QIDQ968403FDOQ968403
Matthew J. Patitz, Scott M. Summers
Publication date: 5 May 2010
Published in: Natural Computing (Search for Journal in Brave)
Abstract: In this paper, we search for {it absolute} limitations of the Tile Assembly Model (TAM), along with techniques to work around such limitations. Specifically, we investigate the self-assembly of fractal shapes in the TAM. We prove that no self-similar fractal fully weakly self-assembles at temperature 1, and that certain kinds of self-similar fractals do not strictly self-assemble at any temperature. Additionally, we extend the fiber construction from Lathrop et. al. (2007) to show that any self-similar fractal belonging to a particular class of "nice" self-similar fractals has a fibered version that strictly self-assembles in the TAM.
Full work available at URL: https://arxiv.org/abs/0803.1672
Recommendations
- Self-assembly of Discrete Self-similar Fractals
- Limitations of self-assembly at temperature 1
- Self-assembly of 4-sided fractals in the two-handed tile assembly model
- Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
- Strict self-assembly of fractals using multiple hands
Cites Work
- Strict self-assembly of discrete Sierpinski triangles
- The program-size complexity of self-assembled squares (extended abstract)
- Combinatorial optimization problems in self-assembly
- Title not available (Why is that?)
- Complexity of Self‐Assembled Shapes
- Self-assembly of the discrete Sierpinski carpet and related fractals
- Reducing tile complexity for self-assembly through temperature programming
- Mathematical Foundations of Computer Science 2005
Cited In (19)
- An introduction to tile-based self-assembly and a survey of recent results
- Scaled pier fractals do not strictly self-assemble
- Approximate self-assembly of the Sierpinski triangle
- Scaled Tree Fractals Do not Strictly Self-assemble
- Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
- Towards the algorithmic molecular self-assembly of fractals by cotranscriptional folding
- On the effects of hierarchical self-assembly for reducing program-size complexity
- The need for seed (in the abstract Tile Assembly Model)
- Title not available (Why is that?)
- Fractal dimension of assemblies in the abstract tile assembly model
- Self-assembly of infinite structures: a survey
- Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles
- Self-assembly of 4-sided fractals in the two-handed tile assembly model
- Strict self-assembly of fractals using multiple hands
- Self-assembling rulers for approximating generalized Sierpinski carpets
- Self-assembly of Discrete Self-similar Fractals
- A Limit to the Power of Multiple Nucleation in Self-assembly
- Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles
- Hierarchical self-assembly of fractals with signal-passing tiles
This page was built for publication: Self-assembly of discrete self-similar fractals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968403)
