Related papers: Noncooperative algorithms in self-assembly
In this paper we present a model containing modifications to the Signal-passing Tile Assembly Model (STAM), a tile-based self-assembly model whose tiles are capable of activating and deactivating glues based on the binding of other glues.…
Theories of phase change and self-assembly often invoke the idea of a `quasiequilibrium', a regime in which the nonequilibrium association of building blocks results nonetheless in a structure whose properties are determined solely by an…
We consider the problem of directly optimizing a non-linear function of an outcome, where this outcome itself is the sum of many small contributions. The non-linearity of the function means that the problem is not equivalent to the…
Autonomous assembly is a crucial capability for robots in many applications. For this task, several problems such as obstacle avoidance, motion planning, and actuator control have been extensively studied in robotics. However, when it comes…
In 2004, Klavins et al. introduced the use of graph grammars to describe -- and to program -- systems of self-assembly. We show that these graph grammars can be embedded in a graph rewriting characterization of distributed systems that was…
While the SLIM approach obtained high ranking-accuracy in many experiments in the literature, it is also known for its high computational cost of learning its parameters from data. For this reason, we focus in this paper on variants of…
We prove that by successively combining subassemblies, we can achieve sublinear construction times for "staged" assembly of micro-scale objects from a large number of tiny particles, for vast classes of shapes; this is a significant advance…
Joint alignment of a collection of functions is the process of independently transforming the functions so that they appear more similar to each other. Typically, such unsupervised alignment algorithms fail when presented with complex data…
This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Assembly of multi-part physical structures is both a valuable end product for autonomous robotics, as well as a valuable diagnostic task for open-ended training of embodied intelligent agents. We introduce a naturalistic physics-based…
We introduce a new class of possibly noncompact n-dimensional manifolds without boundary associated to finite data which we call topological automata. This class is large enough to contain many interesting examples of open 2-dimensional and…
We present fast simulation methods for the self-assembly of complex shapes in two dimensions. The shapes are modeled via a general boundary curve and interact via a standard volume term promoting overlap and an interpenetration penalty. To…
In this paper we propose a research programme for getting structural characterisations for 2-dimensional languages generated by self-assembling tiles. This is part of a larger programme on getting a formal foundation of parallel,…
The number of distinguishable inherent structures of a liquid is the key component to understanding the thermodynamics of glass formers. In the case of hard potential systems such as hard discs, spheres and ellipsoids, an inherent structure…
We say that a tile is $\sigma$-morphic if it tiles the plane in exactly $\aleph_0$ many noncongruent ways (up to an isometry). It is an unsolved problem of whether a $\sigma$-morphic tile exist in the plane. In this note we present a…
We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…
Inspired by the modelization of 2D materials systems, we characterize arrangements of identical nonflat squares in 3D. We prove that the fine geometry of such arrangements is completely characterized in terms of patterns of mutual…
Traditionally, numerical algorithms are seen as isolated pieces of code confined to an {\em in silico} existence. However, this perspective is not appropriate for many modern computational approaches in control, learning, or optimization,…
Geometric frustration offers a pathway to soft matter self-assembly with controllable finite sizes. While the understanding of frustration in soft matter assembly derives almost exclusively from continuum elastic descriptions, a current…