English
Related papers

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

200 papers

In this paper, we prove that in the abstract Tile Assembly Model (aTAM), an accretion-based model which only allows for a single tile to attach to a growing assembly at each step, there are no tile assembly systems capable of…

Emerging Technologies · Computer Science 2018-07-18 Jacob Hendricks , Joseph Opseth , Matthew Patitz , Scott Summers

In this paper, we show that any scaled-up version of any discrete self-similar {\it tree} fractal does not strictly self-assemble, at any temperature, in Winfree's abstract Tile Assembly Model.

Computational Geometry · Computer Science 2014-11-13 Kimberly Barth , David Furcy , Scott M. Summers , Paul Totzke

This paper gives a (polynomial time) algorithm to decide whether a given Discrete Self-Similar Fractal Shape can be assembled in the aTAM model.In the positive case, the construction relies on a Self-Assembling System in the aTAM which…

Discrete Mathematics · Computer Science 2024-06-04 Florent Becker

In this paper, we present high-level overviews of tile-based self-assembling systems capable of producing complex, infinite, aperiodic structures known as discrete self-similar fractals. Fractals have a variety of interesting mathematical…

Emerging Technologies · Computer Science 2016-12-26 Jacob Hendricks , Meagan Olsen , Matthew J. Patitz , Trent A. Rogers , Hadley Thomas

A \emph{pier fractal} is a discrete self-similar fractal whose generator contains at least one \emph{pier}, that is, a member of the generator with exactly one adjacent point. Tree fractals and pinch-point fractals are special cases of pier…

Computational Geometry · Computer Science 2014-06-18 David Furcy , Scott M. Summers

We consider the self-assembly of fractals in one of the most well-studied models of tile based self-assembling systems known as the Two-handed Tile Assembly Model (2HAM). In particular, we focus our attention on a class of fractals called…

Emerging Technologies · Computer Science 2018-10-12 Jacob Hendricks , Joseph Opseth

This paper answers a long-standing open question in tile-assembly theory, namely that it is possible to strictly assemble discrete self-similar fractals (DSSFs) in the abstract Tile-Assembly Model (aTAM). We prove this in 2 separate ways,…

Computational Geometry · Computer Science 2024-10-11 Florent Becker , Daniel Hader , Matthew J. Patitz

We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1…

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

In this work we propose a generalization of Winfree's abstract Tile Assembly Model (aTAM) in which tile types are assigned rigid shapes, or geometries, along each tile face. We examine the number of distinct tile types needed to assemble…

Computational Geometry · Computer Science 2015-03-19 Bin Fu , Matthew J. Patitz , Robert T. Schweller , Bobby Sheline

Winfree's abstract Tile Assembly Model (aTAM) is a model of molecular self-assembly of DNA complexes known as tiles, which float freely in solution and attach one at a time to a growing "seed" assembly based on specific binding sites on…

Computational Complexity · Computer Science 2015-03-17 Ho-Lin Chen , David Doty , Shinnosuke Seki

In this paper we define the Dupled abstract Tile Assembly Model (DaTAM), which is a slight extension to the abstract Tile Assembly Model (aTAM) that allows for not only the standard square tiles, but also "duple" tiles which are rectangles…

Emerging Technologies · Computer Science 2014-03-10 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers , Scott M. Summers

We consider the problem of fault-tolerance in nanoscale algorithmic self-assembly. We employ a variant of Winfree's abstract Tile Assembly Model (aTAM), the two-handed aTAM, in which square "tiles" -- a model of molecules constructed from…

Data Structures and Algorithms · Computer Science 2015-03-14 David Doty , Matthew J. Patitz , Dustin Reishus , Robert T. Schweller , Scott M. Summers

In this paper, we study the minimum number of unique tile types required for the self-assembly of thin rectangles in Winfree's abstract Tile Assembly Model (aTAM), restricted to temperature-1. Using Catalan numbers, planar self-assembly and…

Computational Geometry · Computer Science 2019-06-18 David Furcy , Scott M. Summers , Christian Wendlandt

We investigate the power of the Wang tile self-assembly model at temperature 1, a threshold value that permits attachment between any two tiles that share even a single bond. When restricted to deterministic assembly in the plane, no…

Computational Complexity · Computer Science 2015-03-13 Matthew Cook , Yunhui Fu , Robert T. Schweller

We demonstrate existence of a tile assembly system that self-assembles the statistically self-similar Sierpinski Triangle in the Winfree-Rothemund Tile Assembly Model. This appears to be the first paper that considers self-assembly of a…

Computational Complexity · Computer Science 2011-07-21 Aaron Sterling

Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for an arbitrary finite, connected shape $X \subset \mathbb{Z}^2$, there is a tile set that uniquely self-assembles into a 3D representation of…

Computational Geometry · Computer Science 2015-07-24 David Furcy , Scott M. Summers

We introduce a new model of algorithmic tile self-assembly called size-dependent assembly. In previous models, supertiles are stable when the total strength of the bonds between any two halves exceeds some constant temperature. In this…

Computational Geometry · Computer Science 2015-09-24 Sándor P. Fekete , Robert T. Schweller , Andrew Winslow

This paper concerns the self-assembly of scaled-up versions of arbitrary finite shapes. We work in the multiple temperature model that was introduced by Aggarwal, Cheng, Goldwasser, Kao, and Schweller (Complexities for Generalized Models of…

Computational Complexity · Computer Science 2009-09-30 Scott M. Summers

We prove that if a set $X \subseteq \Z^2$ weakly self-assembles at temperature 1 in a deterministic tile assembly system satisfying a natural condition known as \emph{pumpability}, then $X$ is a finite union of semi-doubly periodic sets.…

Discrete Mathematics · Computer Science 2009-03-12 David Doty , Matthew J Patitz , Scott M Summers

In the abstract Tile Assembly Model (aTAM), the phenomenon of cooperation occurs when the attachment of a new tile to a growing assembly requires it to bind to more than one tile already in the assembly. Often referred to as…

Emerging Technologies · Computer Science 2014-03-18 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers
‹ Prev 1 2 3 10 Next ›