Related papers: Optimal Staged Self-Assembly of General Shapes

In this paper, we present a novel local and parallel two-grid finite element scheme for solving the Stokes equations, and rigorously establish its a priori error estimates. The scheme admits simultaneously small scales of subproblems and…

On modern large-scale parallel computers, the performance of Krylov subspace iterative methods is limited by global synchronization. This has inspired the development of $s$-step Krylov subspace method variants, in which iterations are…

For a classical simple and simply connected group $G$, let $\mathcal{M}_{G,\omega}$ be the moduli space of $\omega$-semistable parabolic $G$-bundles on a complex smooth projective curve of genus $g$. We prove two results in this article:…

Tile-based self-assembly systems are capable of universal computation and algorithmically-directed growth. Systems capable of such behavior typically make use of "glue cooperation" in which the glues on at least $2$ sides of a tile must…

We prove a new structural result for the spherical Tits building attached to SL_n(K) for many number fields K, and more generally for the fraction fields of many Dedekind domains O: the Steinberg module St_n(K) is generated by integral…

We consider the problem of cutting a set of edges on a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total number of cut edges or their total length. We show that this…

We prove several limits on the behavior of a model of self-assembling particles introduced by Dabby and Chen (SODA 2013), called insertion systems, where monomers insert themselves into the middle of a growing linear polymer. First, we…

Given a substitution tiling $T$ of the plane with subdivision operator $\tau$, we study the conformal tilings $\mathcal{T}_n$ associated with $\tau^n T$. We prove that aggregate tiles within $\mathcal{T}_n$ converge in shape as…

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…

We characterize the complexity of the PATS problem for patterns of fixed height and color count in variants of the model where seed glues are either chosen or fixed and identical (so-called non-uniform and uniform variants). We prove that…

We investigate a class of "shape allophiles" that fit together like puzzle pieces as a method to access and stabilize desired structures by controlling directional entropic forces. Squares are cut into rectangular halves, which are shaped…

We introduce a quantum cluster algebra structure $\mathscr A_\omega(\mathfrak{S})$ inside the skew-field fractions ${\rm Frac}\bigl(\widetilde{\mathscr{S}}_\omega(\mathfrak{S})\bigr)$ of the projected stated ${\rm SL}_n$-skein algebra…

Tile B-splines in $\mathbb{R}^d$ are defined as autoconvolutions of the indicators of tiles, which are special self-similar compact sets whose integer translates tile the space $\mathbb{R}^d$. These functions are not piecewise-polynomial,…

We consider the problem of learning unions of rectangles over the domain $[b]^n$, in the uniform distribution membership query learning setting, where both b and n are "large". We obtain poly$(n, \log b)$-time algorithms for the following…

In this paper, we prove that for any $1/2<t<1$, there exists a positive integer $N_{0}$ depending on $t$ such that for any $n_{0}\geq N_{0}$, squares of sidelength $f(n)^{-t}$ for $n\geq n_{0}$ can be packed with disjoint interiors into a…

Algorithmic self-assembly, a generalization of crystal growth processes, has been proposed as a mechanism for autonomous DNA computation and for bottom-up fabrication of complex nanostructures. A `program' for growing a desired structure…

We investigate the polynomial-time approximability of the multistage version of Min-Sum Set Cover ($\mathrm{DSSC}$), a natural and intriguing generalization of the classical List Update problem. In $\mathrm{DSSC}$, we maintain a sequence of…

Patterned self-assembly tile set synthesis (PATS) aims at finding a minimum tile set to uniquely self-assemble a given rectangular color pattern. For $k \ge 1$, $k$-PATS is a variant of PATS that restricts input patterns to those with at…

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

This paper justifies an assertion in (Elder, Proc AMS 137 (2009), no 4, 1193--1203) that Galois scaffolds make the questions of Galois module structure tractable. Let $k$ be a perfect field of characteristic $p$ and let $K=k((T))$. For the…