Related papers: Verification in Staged Tile Self-Assembly
Many engineering failures in orientation-dependent systems are geometric failure modes: changing the geometry can eliminate what changing the material merely delays. The mono-monostatic property (exactly one stable equilibrium under…
Discrete tomography deals with reconstructing finite spatial objects from lower dimensional projections and has applications for example in timetable design. In this paper we consider the problem of reconstructing a tile packing from its…
Majumder, Reif and Sahu have presented a stochastic model of reversible, error-permitting, two-dimensional tile self-assembly, and showed that restricted classes of tile assembly systems achieved equilibrium in (expected) polynomial time.…
Based on numerical data and a-posteriori analysis we verify rigorously the uniqueness and smoothness of global solutions to a scalar surface growth model with striking similarities to the 3D Navier--Stokes equations, for certain initial…
In this paper, we study an extension of the CPE conjecture to manifolds $M$ which support a structure relating curvature to the geometry of a smooth map $\varphi : M \to N$. The resulting system, denoted by $(\varphi-\mathrm{CPE})$, is…
We prove that if $G$ is a finite flat group scheme of $p$ power rank over a perfect field of characteristic $p$, then the second crystalline cohomology of its classifying stack $H^2_{crys}(BG)$ recovers the Dieudonn\'e module of $G$. We…
This thesis is divided into two parts. In the first part we study completely integrable systems, and their underlying structures, in detail. We study their deformation theory and the different equivalence relations surrounding it. We…
In this paper we explore the power of geometry to overcome the limitations of non-cooperative self-assembly. We define a generalization of the abstract Tile Assembly Model (aTAM), such that a tile system consists of a collection of…
Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…
2-dimensional Matching Problem, which requires to find a matching of left- to right-vertices in a balanced $2n$-vertex bipartite graph, is a well-known polynomial problem, while various variants, like the 3-dimensional analogoue (3DM, with…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of…
The spread of autonomous systems into safety-critical areas has increased the demand for their formal verification, not only due to stronger certification requirements but also to public uncertainty over these new technologies. However, the…
We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…
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…
Single individual haplotyping is an NP-hard problem that emerges when attempting to reconstruct an organism's inherited genetic variations using data typically generated by high-throughput DNA sequencing platforms. Genomes of diploid…
The assembly index of assembly theory quantifies the minimal number of composition steps required to construct an object from elementary components. The study proves that the decision version of the assembly index problem is NP-complete,…
We classify complex projective surfaces with an automorphism of positive entropy for which the unique invariant measure of maximal entropy is absolutely continuous with respect to Lebesgue measure.
A polynomial automorphism of $\mathbb{A}^n$ over a field of characteristic zero is called co-tame if, together with the affine subgroup, it generates the entire tame subgroup. We prove some new classes of automorphisms, including…
Patchy colloids are promising candidates for building blocks in directed self-assembly. To be successful the surface patterns need to both be simple enough to be synthesized, while feature-rich enough to cause the colloids to self-assemble…