Related papers: Verification in Staged Tile Self-Assembly
Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…
We investigate the parameterized complexity of Binary CSP parameterized by the vertex cover number and the treedepth of the constraint graph, as well as by a selection of related modulator-based parameters. The main findings are as follows:…
Self-assembly processes are widespread in nature, and lie at the heart of many biological and physical phenomena. The characteristics of self-assembly building blocks determine the structures that they form. Two crucial properties are the…
It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…
The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism $\mathbf{R}\to \mathbf{\Gamma}$ between two relational structures, where $\mathbf{R}$ is defined over a domain $V$ and $\mathbf{\Gamma}$ is defined over a…
We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…
We give a complete solution to the extremal topological combinatorial problem of finding the minimum number of tiles needed to construct a polyomino with $h$ holes. We denote this number by $g(h)$ and say that a polyomino is crystallized if…
We prove a Poincare lemma for a set of r smooth functions on a 2n-dimensional smooth manifold satisfying a commutation relation determined by r singular vector fields associated to a Cartan subalgebra of $\frak{sp}(2r,\mathbb R)$. This…
Let $(M, \om)$ be a symplectic manifold, endowed with a compatible almost complex structure J and the associated metric g . For any p \in {1, 2, ... (dim M)/2} the form $\Om := \frac{\om^p}{p!}$ is a calibration. More generally, dropping…
We classify the resolution graphs of weighted homogeneous surface singularities which admit rational homology disk smoothings. The nonexistence of rational homology disk smoothings is shown by symplectic geometric methods, while the…
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…
We construct the moduli space of smooth hypersurfaces with level $N$ structure over $\mathbb{Z}[1/N]$. As an application we show that, for $N$ large enough, the stack of smooth hypersurfaces over $\mathbb{Z}[1/N]$ is uniformisable by a…
We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…
We show that geometric frustration in a broad class of deformable and naturally curved, shell-like colloidal particles gives rise to self-limiting assembly of finite-sized stacks that far exceed particle dimensions. When inter-particle…
This work revisits the PCP Verifiers used in the works of Hastad [Has01], Guruswami et al.[GHS02], Holmerin[Hol02] and Guruswami[Gur00] for satisfiable Max-E3-SAT and Max-Ek-Set-Splitting, and independent set in 2-colorable 4-uniform…
Quantifying local structures in self-assembled systems is a central challenge in soft matter and materials science. When no a priori knowledge of the relevant structures is available, traditional order parameters often fall short.…
Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a…
We present the first formal verification of approximation algorithms for NP-complete optimization problems: vertex cover, independent set, set cover, center selection, load balancing, and bin packing. We uncover incompletenesses in existing…
In this paper we provide a new method to certify that a nearby polynomial system has a singular isolated root with a prescribed multiplicity structure. More precisely, given a polynomial system f $=(f\_1, \ldots, f\_N)\in C[x\_1, \ldots,…
We develop a decoupled, first-order, fully discrete, energy-stable scheme for the Cahn-Hilliard-Navier-Stokes equations. This scheme calculates the Cahn-Hilliard and Navier-Stokes equations separately, thus effectively decoupling the entire…