English
Related papers

Related papers: Self-Assembly of Discrete Self-Similar Fractals

200 papers

We introduce a new property of tile self-assembly systems that we call size-separability. A system is size-separable if every terminal assembly is a constant factor larger than any intermediate assembly. Size-separability is motivated by…

Computational Geometry · Computer Science 2014-04-30 Andrew Winslow

Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for all $N \in \mathbb{N}$, there is a tile set that uniquely self-assembles into an $N \times N$ square shape at temperature 1 with optimal…

Computational Geometry · Computer Science 2014-11-06 David Furcy , Samuel Micka , Scott M. Summers

Self-assembly is one of the prevalent strategies used by living systems to fabricate ensembles of precision nanometer-scale structures and devices. The push for analogous approaches to create synthetic nanomaterials has led to the…

We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently grown parts must always agree with each other. Tile…

Computational Geometry · Computer Science 2015-02-20 Florent Becker , Pierre-Étienne Meunier

It is well known that the discrete Sierpinski triangle can be defined as the nonzero residues modulo 2 of Pascal's triangle, and that from this definition one can easily construct a tileset with which the discrete Sierpinski triangle…

Other Computer Science · Computer Science 2009-01-22 Steven M. Kautz , James I. Lathrop

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers

In this paper we investigate the computational power of the polygonal tile assembly model (polygonal TAM) at temperature 1, i.e. in non-cooperative systems. The polygonal TAM is an extension of Winfree's abstract tile assembly model (aTAM)…

Computational Geometry · Computer Science 2015-08-20 Oscar Gilbert , Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

We prove that if a subset X of the integer Cartesian plane weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as *pumpability*, then X is a finite union of doubly…

Computational Complexity · Computer Science 2009-06-18 David Doty , Matthew J. Patitz , Scott M. Summers

The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem of \emph{shape construction}, we consider an extended version of the Two-Handed Tile Assembly Model (2HAM), which contains…

Computational Geometry · Computer Science 2016-08-18 Austin Luchsinger , Robert Schweller , Tim Wylie

The concept of self-similarity on subsets of algebraic varieties is defined by considering algebraic endomorphisms of the variety as `similarity' maps. Self-similar fractals are subsets of algebraic varieties which can be written as a…

Number Theory · Mathematics 2015-04-21 Arash Rastegar

We study derivations and Fredholm modules on metric spaces with a local regular conservative Dirichlet form. In particular, on finitely ramified fractals, we show that there is a non-trivial Fredholm module if and only if the fractal is not…

Operator Algebras · Mathematics 2018-06-29 Marius Ionescu , Luke G. Rogers , Alexander Teplyaev

The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…

Soft Condensed Matter · Physics 2022-03-02 Thomas E. Videbæk , Huang Fang , Daichi Hayakawa , Botond Tyukodi , Michael F. Hagan , W. Benjamin Rogers

In this paper, we extend existing results about simulation and intrinsic universality in a model of tile-based self-assembly. Namely, we work within the 2-Handed Assembly Model (2HAM), which is a model of self-assembly in which assemblies…

Computational Geometry · Computer Science 2015-03-17 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T.…

Data Structures and Algorithms · Computer Science 2012-04-10 David Doty , Jack H. Lutz , Matthew J. Patitz , Robert T. Schweller , Scott M. Summers , Damien Woods

We use computational modeling to investigate the assembly thermodynamics of a particle-based model for geometrically frustrated assembly, in which the local packing geometry of subunits is incompatible with uniform, strain-free large-scale…

Soft Condensed Matter · Physics 2021-09-06 Botond Tyukodi , Farzaneh Mohajerani , Douglas M. Hall , Gregory M. Grason , Michael F. Hagan

In this paper, we work in a 2D version of the probabilistic variant of Winfree's abstract Tile Assembly Model defined by Chandran, Gopalkrishnan and Reif (SICOMP 2012) in which attaching tiles are sampled uniformly with replacement. First,…

Data Structures and Algorithms · Computer Science 2024-08-13 David Furcy , Scott M. Summers

We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we prove that Winfree's abstract Tile Assembly Model, when…

Computational Complexity · Computer Science 2013-04-11 Pierre-Étienne Meunier , Matthew J. Patitz , Scott M. Summers , Guillaume Theyssier , Andrew Winslow , Damien Woods

We show that the Tile Assembly Model exhibits a strong notion of universality where the goal is to give a single tile assembly system that simulates the behavior of any other tile assembly system. We give a tile assembly system that is…

Computational Complexity · Computer Science 2016-09-08 David Doty , Jack H. Lutz , Matthew J. Patitz , Scott M. Summers , Damien Woods

Self-assembly is the process in which the components of a system, whether molecules, polymers, or macroscopic particles, are organized into ordered structures as a result of local interactions between the components themselves, without…

Discrete Mathematics · Computer Science 2022-01-13 Thomas Fernique , Ilya Galanov

A general class of finitely ramified fractals is that of P.C.F. self-similar sets. An important open problem in analysis on fractals was whether there exists a self-similar energy on every P.C.F. self-similar set. In this paper, I solve the…

Functional Analysis · Mathematics 2017-01-30 Roberto Peirone