Related papers: Verification in Staged Tile Self-Assembly
In contrast to most self-assembling synthetic materials, which undergo unbounded growth, many biological self-assembly processes are self-limited. That is, the assembled structures have one or more finite dimensions that are much larger…
This paper presents two new constructions related to singular solutions of polynomial systems. The first is a new deflation method for an isolated singular root. This construc-tion uses a single linear differential form defined from the…
This study investigates the impact of finite element selection on structural topology optimization using the SIMP (Solid Isotropic Material with Penalization) method. Specifically, it compares linear (P1) and quadratic (P2) triangular…
We study the Unique Set Cover problem on unit disks and unit squares. For a given set $P$ of $n$ points and a set $D$ of $m$ geometric objects both in the plane, the objective of the Unique Set Cover problem is to select a subset…
We provide a computer-assisted approach to ensure that a given continuous or discrete-time polynomial system is (asymptotically) stable. Our framework relies on constructive analysis together with formally certified sums of squares Lyapunov…
We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…
Single-layer PtN$_2$ exhibits an intriguing structure consisting of a tessellation pattern called the Cairo tessellation of type 2 pentagons, which belong to one of the existing 15 types of convex pentagons discovered so far that can…
Sweeping is a powerful and versatile method of designing objects. Boundary of volumes (henceforth envelope) obtained by sweeping solids have been extensively investigated in the past, though, obtaining an accurate parametrization of the…
In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly…
We consider the self-assembly of composite structures from a group of nanocomponents, each consisting of particles within an $N$-atom system. Self-assembly pathways and rates for nanocomposites are derived via a multiscale analysis of the…
The convergence of iterative schemes to achieve self-consistency in mean field problems such as the Schr\"odinger-Poisson equation is notoriously capricious. It is particularly difficult in regimes where the non-linearities are strong such…
Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for…
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 study proof techniques for bisimilarity based on unique solution of equations. We draw inspiration from a result by Roscoe in the denotational setting of CSP and for failure semantics, essentially stating that an equation (or a system of…
We study the simultaneous embeddability of a pair of partitions of the same underlying set into disjoint blocks. Each element of the set is mapped to a point in the plane and each block of either of the two partitions is mapped to a region…
The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…
Polymer-grafted nanoparticles are versatile building blocks that self-assemble into a rich diversity of mesostructures. Coarse-grained molecular simulations have commonly accompanied experiments by resolving structure formation pathways and…
The control over the self-assembly of complex structures is a long-standing challenge of material science, especially at the colloidal scale, as the desired assembly pathway is often kinetically derailed by the formation of amorphous…
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…
In the Constraint Satisfaction Problem (CSP for short) the goal is to decide the existence of a homomorphism from a given relational structure $G$ to a given relational structure $H$. If the structure $H$ is fixed and $G$ is the only input,…