Related papers: Optimal Staged Self-Assembly of General Shapes

We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…

Let T be a tile in the Cartesian plane made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be…

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This…

For positive integers $k$, $n$, and $g$ with $k\geq2$, we give a closed-form expression for the $k$-th $\mathbb{Z}_2$-zero-divisor cup length $\mathsf{zcl}_k(SP^n(N_g))$ of the $n$-th symmetric product $SP^n(N_g)$ of the closed…

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\log^2n)$ bits and it converges in $O(n^2)$ rounds. Thus, this algorithm improves the convergence time of…

Let $A$ be a central simple algebra over a number field $K$ with ring of integers $\mathcal{O}_K$, such that either the degree of the algebra $n \ge 3$, or $n=2$ and $A$ is not a totally definite quaternion algebra. Then strong…

In this paper, we analyze the sum of squares hierarchy (SOS) on the ordering principle on $n$ elements. We prove that degree $O(\sqrt{n}log(n))$ SOS can prove the ordering principle. We then show that this upper bound is essentially tight…

We describe a computational model for studying the complexity of self-assembled structures with active molecular components. Our model captures notions of growth and movement ubiquitous in biological systems. The model is inspired by…

In this paper we consider the problem of efficiently constructing $k$-vertex fault-tolerant geometric $t$-spanners in $\dspace$ (for $k \ge 0$ and $t >1$). Vertex fault-tolerant spanners were introduced by Levcopoulus et. al in 1998. For…

In the abstract Tile Assembly Model (aTAM) square tiles self-assemble, autonomously binding via glues on their edges, to form structures. Algorithmic aTAM systems can be designed in which the patterns of tile attachments are forced to…

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.…

This paper introduces the theory and practice of formal verification of self-assembling systems. We interpret a well-studied abstraction of nanomolecular self assembly, the Abstract Tile Assembly Model (aTAM), into Computation Tree Logic…

We restrict our discussion to the orientable category. For $g > 1$, let $OE_g$ be the maximum order of a finite group $G$ acting on the closed surface $\Sigma_g$ of genus $g$ which extends over $(S^3, \Sigma_g)$, where the maximum is taken…

In this paper, we first give a short account on the indecomposable sl(2,C) modules in the Bernstein-Gelfand-Gelfand (BGG) category O. We show these modules naturally arise for homogeneous integrable nonlinear evolutionary systems. We then…

Spherical $t$-designs on $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ provide $N$ nodes for an equal weight numerical integration rule which is exact for all spherical polynomials of degree at most $t$. This paper considers the generation of…

Given a closed polygon P having n edges, embedded in R^d, we give upper and lower bounds for the minimal number of triangles t needed to form a triangulated PL surface in R^d having P as its geometric boundary. The most interesting case is…

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

It is shown that $S(G) = O\left(m/\log_2 m + d\right)$ pebbles are sufficient to pebble any DAG $G=(V,E)$, with $m$ edges and maximum in-degree $d$. It was previously known that $S(G) = O\left(d n/\log n\right)$. The result builds on two…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

The ability to design and synthesize ever more complicated colloidal particles opens the possibility of self-assembling a zoo of complex structures, including those with one or more self-limited length scales. An undesirable feature of…