Self-assembly of shapes at constant scale using repulsive forces

The algorithmic self-assembly of shapes has been considered in several models of self-assembly. For the problem of shape construction, we consider an extended version of the two-handed tile assembly model, which contains positive (attractive) and negative (repulsive) interactions. As a result, portions of an assembly can become unstable and detach. In this model, we utilize fuel-efficient computation to perform Turing machine simulations for the construction of the shape. In this paper, we show how an arbitrary shape can be constructed using an asymptotically optimal number of distinct tile types (based on the shape’s Kolmogorov complexity). We achieve this at O(1) scale factor in this straightforward model, whereas all previous results with sublinear scale factors utilize powerful self-assembly models containing features such as staging, tile deletion, chemical reaction networks, and tile activation/deactivation. Furthermore, the computation and construction in our result only creates constant-size garbage assemblies as a byproduct of assembling the shape.

[1]  Ming-Yang Kao,et al.  Complexities for generalized models of self-assembly , 2004, SODA '04.

[2]  Lila Kari,et al.  Negative Interactions in Irreversible Self-assembly , 2010, Algorithmica.

[3]  Erik D. Demaine,et al.  Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) , 2010, STACS.

[4]  Erik D. Demaine,et al.  Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces , 2017, SODA.

[5]  Ján Manuch,et al.  Step-wise tile assembly with a constant number of tile types , 2012, Natural Computing.

[6]  Erik D. Demaine,et al.  Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues , 2008, Natural Computing.

[7]  Matthew J. Patitz,et al.  Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly , 2016, DNA.

[8]  Scott M. Summers.  Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming , 2011, Algorithmica.

[9]  Matthew J. Patitz,et al.  Resiliency to multiple nucleation in temperature-1 self-assembly , 2017, Natural Computing.

[10]  Qi Cheng.  On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields , 2005, SIAM J. Comput..

[11]  Robert T. Schweller,et al.  Fuel Efficient Computation in Passive Self-Assembly , 2013, SODA.

[12]  Erik Winfree,et al.  Complexity of Self-Assembled Shapes , 2004, SIAM J. Comput..

[13]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[14]  Erik D. Demaine,et al.  New geometric algorithms for fully connected staged self-assembly , 2015, Theor. Comput. Sci..

[15]  Matthew J. Patitz,et al.  Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue , 2011, DNA.

[16]  P W Rothemund,et al.  Using lateral capillary forces to compute by self-assembly , 2000, Proc. Natl. Acad. Sci. USA.

[17]  Sudheer Sahu,et al.  Complexity of graph self-assembly in accretive systems and self-destructible systems , 2005, Theor. Comput. Sci..

[18]  Erik Winfree,et al.  Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model , 2015, DNA.