Related papers: SAT-assembly: A new approach for designing self-as…
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking predicates (SBPs) is a well-known, often effective, technique…
Over the last two decades, propositional satisfiability (SAT) has become one of the most successful and widely applied techniques for the solution of NP-complete problems. The aim of this paper is to investigate theoretically how Sat can be…
Pattern self-assembly tile set synthesis (PATS) is a combinatorial optimization problem which aim at minimizing a rectilinear tile assembly system (RTAS) that uniquely self-assembles a given rectangular pattern, and is known to be NP-hard.…
In living cells, proteins self-assemble into large functional structures based on specific interactions between molecularly complex patches. Due to this complexity, protein self-assembly results from a competition between a large number of…
We introduce allostery-mimetic building blocks model for self-assembly of 3D structures. We represent the building blocks as patchy particles, where each binding site (patch) can be irreversibly activated or deactivated by binding of the…
Self-assembly materials are traditionally designed so that molecular or meso-scale components form a single kind of large structure. Here, we propose a scheme to create "multifarious assembly mixtures", which self-assemble many different…
Designing heterogeneous, self-assembling systems is a central challenge in soft matter and biology. We present a framework that uses gradient-based optimization to invert an analytical yield calculation, tuning systems toward target…
Model robustness against adversarial examples of single perturbation type such as the $\ell_{p}$-norm has been widely studied, yet its generalization to more realistic scenarios involving multiple semantic perturbations and their…
Self-assembly is one of the prevalent strategies used by living systems to fabricate ensembles of precision nanometer-scale structures and devices. The push for analogous approaches to create synthetic nanomaterials has led to the…
We devise an inverse statistical-mechanical methodology to find optimized interaction potentials that lead spontaneously to a target many-particle configuration. Target structures can possess varying degrees of disorder, thus extending the…
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…
Experiments have reached a monumental capacity for designing and synthesizing microscopic particles for self-assembly, making it possible to precisely control particle concentrations, shapes, and interactions. However, more physical insight…
This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…
Abstract geometrical computation can solve hard combinatorial problems efficiently: we showed previously how Q-SAT can be solved in bounded space and time using instance-specific signal machines and fractal parallelization. In this article,…
Reconfiguration aims at recovering a system from a fault by automatically adapting the system configuration, such that the system goal can be reached again. Classical approaches typically use a set of pre-defined faults for which…
At the cutting edge of materials science, matter is designed to self-organize into structures that perform a wide range of functions. The past two decades have witnessed major innovations in the versatility of building blocks, ranging from…
This article introduces a Synthetics, Aggregation, and Test inversion (SAT) approach for merging diverse and potentially dependent uncertainty sets into a single unified set. The procedure is data-light, relying only on initial sets and…
Controlling the topology of structures self-assembled from a set of heterogeneous building blocks is highly desirable for many applications, but is poorly understood theoretically. Here we show that the thermodynamic theory of self-assembly…
We use inverse methods of statistical mechanics to explore trade-offs associated with designing interactions to stabilize self-assembled structures against changes in density or temperature. Specifically, we find isotropic,convex-repulsive…
The Pattern self-Assembly Tile set Synthesis (PATS) problem is to determine a set of coloured tiles that self-assemble to implement a given rectangular colour pattern. We give an exhaustive branch-and-bound algorithm to find tile sets of…