Related papers: Optimal program-size complexity for self-assembly …
What is the least surface area of a symmetric body $B$ whose $\mathbb{Z}^n$ translations tile $\mathbb{R}^n$? Since any such body must have volume $1$, the isoperimetric inequality implies that its surface area must be at least…
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…
An efficient low-order scaling method is presented for large-scale electronic structure calculations based on the density functional theory using localized basis functions, which directly computes selected elements of the density matrix by…
Patterned self-assembly is a process whereby coloured tiles self-assemble to build a rectangular coloured pattern. We propose self-assembly (SA) hypergraph automata as an automata-theoretic model for patterned self-assembly. We investigate…
Self-assembly of complex and functional materials remains a grand challenge in soft material science. Efficient assembly depends on a delicate balance between thermodynamic and kinetic effects, requiring fine-tuning affinities and…
We consider the thermal softening of crystals due to anharmonicity. Self-consistent methods find a maximum temperature for a stable crystal, which gives an upper bound to the melting temperature. Previous workers have shown that the…
Whether self correcting quantum memories can exist at non-zero temperature in a physically reasonable setting remains a great open problem. It has recently been argued [1] that symmetry protected topological (SPT) systems in three space…
In the self-assembly process which drives the formation of cellular membranes, micelles, and capsids, a collection of separated subunits spontaneously binds together to form functional and more ordered structures. In this work, we study the…
We formulate statistical-mechanical inverse methods in order to determine optimized interparticle interactions that spontaneously produce target many-particle configurations. Motivated by advances that give experimentalists greater and…
We propose a new and effective means for designing stable and fast-folding polypeptide sequences using a cumulant expansion of the molecular partition function. This method is unique in that $T_{Z}$, the ``cumulant design temperature''…
Self-assembly refers to the process by which small, simple components mix and combine to form complex structures using only local interactions. Designed as a hybrid between tile assembly models and cellular automata, the Tile Automata (TA)…
In this paper we consider the problem of the strict self-assembly of infinite fractals within tile self-assembly. In particular, we provide tile assembly algorithms for the assembly of the discrete Sierpinski triangle and the discrete…
Molecular building blocks interacting at the nanoscale organize spontaneously into stable mono- layers that display intriguing long-range ordering motifs on the surface of atomic substrates. The patterning process, if appropriately…
Self-limiting assembly of particles represents the state-of-the-art controllability in nanomanufacturing processes where the assembly stops at a designated stage1,2, providing a desirable platform for applications requiring delicate…
A unique sink orientation (USO) is an orientation of the $n$-dimensional hypercube graph such that every non-empty face contains a unique sink. Schurr showed that given any $n$-dimensional USO and any dimension $i$, the set of edges $E_i$…
Given a set of squares and a strip of bounded width and infinite height, we consider a square strip packaging problem, which we call the square independent packing problem (SIPP), to minimize the strip height so that all the squares are…
We present a quantitative measure of physical complexity, based on the amount of information required to build a given physical structure through self-assembly. Our procedure can be adapted to any given geometry, and thus to any given type…
We study the structure of the digit sets ${\mathcal D}$ for the integral self-similar tiles $T(b,{\mathcal{D}})$ (we call such ${\mathcal D}$ a {\it tile digit set} with respect to $b$). So far the only available classes of such tile digit…
In the Escherization problem, given a closed figure in a plane, the objective is to find a closed figure that is as close as possible to the input figure and tiles the plane. Koizumi and Sugihara's formulation reduces this problem to an…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…