Related papers: New bounds on the tile complexity of thin rectangl…
Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This…
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…
The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…
We give a construction of a self-similar tiling of the plane with any prescribed expansion coefficient $\lambda\in\C$ (satisfying the necessary algebraic condition of being a complex Perron number). For any integer $m>1$ we show that there…
The thermodynamics of the O(N) nonlinear sigma model in 1+1 dimensions is studied. We calculate the pressure to next-to-leading order in the 1/N expansion and show that at this order, only the minimum of the effective potential can be…
A challenge of molecular self-assembly is to understand how to design particles that self-assemble into a desired structure and not any of a potentially large number of undesired structures. Here we use simulation to show that a strategy of…
We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempts of formal analysis or programming: the planar…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…
The computational complexity of tiling finite simply connected regions with a fixed set of tiles is studied in this paper. We show that the problem of tiling simply connected regions with a fixed set of $23$ Wang tiles is NP-complete. As a…
Self-assembly is one of the most promising strategies for making functional materials at the nanoscale, yet new design principles for making self-limiting architectures, rather than spatially unlimited periodic lattice structures, are…
We report new results on complex-temperature properties of Ising models. These include studies of the $s=1/2$ model on triangular, honeycomb, kagom\'e, $3 \cdot 12^2$, and $4 \cdot 8^2$ lattices. We elucidate the complex--$T$ phase diagrams…
Patterned self-assembly tile set synthesis PATS is the problem of finding a minimal tile set which uniquely self-assembles into a given pattern. Czeizler and Popa proved the NP-completeness of PATS and Seki showed that the PATS problem is…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…
In this paper we consider faultfree tromino tilings of rectangles and characterize rectangles that admit such tilings. We introduce the notion of {\it crossing numbers} for tilings and derive bounds on the crossing numbers of faultfree…
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…
In geometrically frustrated assemblies, equilibrium self-limitation manifests in the form of a minimum in the free energy per subunit at a finite, multi-subunit size which results from the competition between the elastic costs of…
A lattice model with soft repulsion followed by attraction is developed for a monolayer of hybrid core-shell particles self-assembling at an interface. The model is solved exactly in one dimension. One, two or three periodic structures and…
We develop tools to study the topology and geometry of self-affine fractals in dimension three and higher. We use the self-affine structure and obtain rather detailed information about the connectedness of interior and boundary sets, and on…
We study a random aggregation process involving rectangular clusters. In each aggregation event, two rectangles are chosen at random and if they have a compatible side, either vertical or horizontal, they merge along that side to form a…
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…