Related papers: SAT-assembly: A new approach for designing self-as…
This paper introduces a new shape-matching methodology, combinative matching, to combine interlocking parts for geometric shape assembly. Previous methods for geometric assembly typically rely on aligning parts by finding identical surfaces…
While colloids are promising building blocks for the self-assembly of materials with novel microstructures, their numerous tunable parameters inhibit brute force searching for appropriate parameter combinations that yield self-assembly of a…
In this short paper we present a survey of some results concerning the random SAT problems. To elaborate, the Boolean Satisfiability (SAT) Problem refers to the problem of determining whether a given set of $m$ Boolean constraints over $n$…
Isotropic pairwise interactions that promote the self assembly of complex particle morphologies have been discovered by inverse design strategies derived from the molecular coarse-graining literature. While such approaches provide an avenue…
In this work we consider the inverse problem of finding guiding pattern shapes that result in desired self-assembly morphologies of block copolymer melts. Specifically, we model polymer self-assembly using Self-Consistent Field Theory and…
Self-assembly is a ubiquitous process in synthetic and biological systems, broadly defined as the spontaneous organization of multiple subunits (e.g. macromolecules, particles) into ordered multi-unit structures. The vast majority of…
We present DeepSAT, a novel end-to-end learning framework for the Boolean satisfiability (SAT) problem. Unlike existing solutions trained on random SAT instances with relatively weak supervision, we propose applying the knowledge of the…
The basic random $k$-SAT problem is: Given a set of $n$ Boolean variables, and $m$ clauses of size $k$ picked uniformly at random from the set of all such clauses on our variables, is the conjunction of these clauses satisfiable? Here we…
In this paper, we introduce the following problem in the theory of algorithmic self-assembly: given an input shape as the seed of a tile-based self-assembly system, design a finite tile set that can, in some sense, uniquely identify whether…
Automatic synthesis of hardware components from declarative specifications is an ambitious endeavor in computer aided design. Existing synthesis algorithms are often implemented with Binary Decision Diagrams (BDDs), inheriting their…
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…
In Verification and in (optimal) AI Planning, a successful method is to formulate the application as boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedures. There is a lack of understanding of why this works…
In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…
We explore the use of templated self-assembly to facilitate the formation of complex target structures made from patchy particles. First, we consider the templating of high-symmetry shell structures around a spherical core particle. We find…
Multi-component self-assembly mixtures offer the possibility of encoding multiple target structures with the same set of interacting components. Selective retrieval of one of the stored structures has been attempted by preparing an initial…
We systematically study the design of simple patchy sphere models that reversibly self-assemble into monodisperse icosahedral clusters. We find that the optimal patch width is a compromise between structural specificity (the patches must be…
A satisfiability (SAT-UNSAT) transition takes place for many optimization problems when the number of constraints, graphically represented by links between variables nodes, is brought above some threshold. If the network of constraints is…
Assembly planning is a fundamental problem in robotics and automation, which involves designing a sequence of motions to bring the separate constituent parts of a product into their final placement in the product. Assembly planning is…
We investigate a set of design principles that link specific features of interparticle interactions to predictable structural and dynamic outcomes in two-dimensional self-assembly, a framework relevant to soft matter and biological…
We present a direct method for solving the inverse problem of designing isotropic potentials that cause self-assembly into target lattices. Each potential is constructed by matching its energy spectrum to the reciprocal representation of…