[Paper Review] Reducing Tile Complexity for the Self-Assembly of Scaled Shapes Through Temperature Programming

Scott M. Summers|ArXiv.org|Jul 7, 2009

Modular Robots and Swarm Intelligence16 references4 citations

TL;DR

This paper introduces temperature programming in the multiple temperature model to reduce tile complexity for self-assembling scaled-up versions of arbitrary finite shapes. It presents two constant-size tile sets: one with asymptotically Kolmogorov-optimal temperature sequences (scaling factor grows with shape size), and another with constant scaling factor but longer temperature sequences. The key contribution is proving that no constant-size tile set can uniquely assemble arbitrary un-scaled shapes, establishing the necessity of scaling for such tile efficiency.

ABSTRACT

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 Self-Assembly, SODA 2004). The multiple temperature model is a natural generalization of Winfree's abstract tile assembly model, where the temperature of a tile system is allowed to be shifted up and down as self-assembly proceeds. We first exhibit two constant-size tile sets in which scaled-up versions of arbitrary shapes self-assemble. Our first tile set has the property that each scaled shape self-assembles via an asymptotically "Kolmogorov-optimum" temperature sequence but the scaling factor grows with the size of the shape being assembled. In contrast, our second tile set assembles each scaled shape via a temperature sequence whose length is proportional to the number of points in the shape but the scaling factor is a constant independent of the shape being assembled. We then show that there is no constant-size tile set that can uniquely assemble an arbitrary (non-scaled, connected) shape in the multiple temperature model, i.e., the scaling is necessary for self-assembly. This answers an open question of Kao and Schweller (Reducing Tile Complexity for Self-Assembly Through Temperature Programming, SODA 2006), who asked whether such a tile set existed.

Motivation & Objective

• To reduce tile complexity in algorithmic self-assembly of arbitrary finite shapes using temperature programming.
• To explore whether constant-size tile sets can assemble arbitrary un-scaled shapes in the multiple temperature model.
• To design tile sets that balance temperature sequence length and scaling factor for efficient self-assembly.
• To establish theoretical limits on tile set size for uniquely assembling arbitrary shapes.

Proposed method

• Utilizes the multiple temperature model, allowing temperature shifts during self-assembly to control binding kinetics.
• Constructs two constant-size tile sets that self-assemble scaled versions of any finite shape through temperature-programmed sequences.
• Employs a temperature sequence that is asymptotically Kolmogorov-optimal in the first construction, where scaling factor grows with shape size.
• In the second construction, maintains a constant scaling factor across all shapes while lengthening the temperature sequence proportionally to the number of points in the shape.
• Uses a proof by contradiction to show that any constant-size tile set cannot uniquely assemble all arbitrary un-scaled shapes, relying on infinite assembly sequences and bond strength analysis.
• Applies concepts from Kolmogorov complexity to relate shape description complexity to minimum tile type requirements.

Experimental results

Research questions

• RQ1 Can constant-size tile sets self-assemble arbitrary un-scaled, connected shapes in the multiple temperature model?
• RQ2 Is it possible to simultaneously minimize both the temperature sequence length and the scaling factor for arbitrary shapes?
• RQ3 What is the minimal tile complexity required to self-assemble scaled shapes using temperature programming?
• RQ4 How does the scaling factor relate to the Kolmogorov complexity of the target shape in temperature-programmed systems?
• RQ5 Can temperature programming enable efficient self-assembly with both low tile count and short assembly sequences?

Key findings

• A constant-size tile set exists that assembles any scaled shape via an asymptotically Kolmogorov-optimal temperature sequence, though the scaling factor grows with the shape size.
• A second constant-size tile set assembles any scaled shape via a temperature sequence of length proportional to the number of points in the shape, with a constant scaling factor independent of the shape.
• It is impossible to uniquely assemble every arbitrary un-scaled, connected shape using any constant-size tile set in the multiple temperature model.
• The proof of impossibility relies on constructing an infinite assembly sequence from a finite tile set, contradicting unique producibility.
• The results establish that scaling is a necessary condition for achieving low tile complexity in temperature-programmed self-assembly.
• The paper leaves open the question of whether a tile set can simultaneously achieve constant scaling and a temperature sequence length of O(K(X)) for any shape X.