Related papers: Optimal Staged Self-Assembly of General Shapes

In this paper we study the computational complexity of solving a class of block structured integer programs (IPs) - so called multistage stochastic IPs. A multistage stochastic IP is an IP of the form $\max \{ c^T x \mid \mathcal{A} x = b,…

The equational complexity function $\beta_\mathscr{V}:\mathbb{N}\to\mathbb{N}$ of an equational class of algebras $\mathscr{V}$ bounds the size of equation required to determine membership of $n$-element algebras in $\mathscr{V}$. Known…

Given a compact, oriented surface $S$ of finite genus and finitely many boundary components, we provide examples of finite covers $\tilde{S}$ of $S$ and non-simple closed curves $\gamma$ on $S$ which lifts to simple closed curves on…

Let $ \text{Mod}(S_g)$ denote the mapping class group of the closed orientable surface $S_g$ of genus $g\geq 2$, and let $f\in \text{Mod}(S_g)$ be of finite order. We give an inductive procedure to construct an explicit hyperbolic structure…

We show that for all functions $t(n) \geq n$, every multitape Turing machine running in time $t$ can be simulated in space only $O(\sqrt{t \log t})$. This is a substantial improvement over Hopcroft, Paul, and Valiant's simulation of time…

Let $g$ be a non-negative integer, $\Sigma _g$ a closed orientable surface of genus $g$, and $\mathcal{M}_g$ its mapping class group. We classify all the group homomorphisms $\pi _1(\Sigma _g)\to G$ up to the action of $\mathcal{M}_g$ on…

This paper studies numerical integration over the unit sphere $ \mathbb{S}^2 \subset \mathbb{R}^{3} $ by using spherical $t$-design, which is an equal positive weights quadrature rule with polynomial precision $t$. We investigate two kinds…

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

In this paper, we develop a multigrid method on unstructured shape-regular grids. For a general shape-regular unstructured grid of ${\cal O}(N)$ elements, we present a construction of an auxiliary coarse grid hierarchy on which a geometric…

Square-triangle-rhombus ($\mathcal{STR}$) tilings are encountered in various self-organized multi-component systems. They exhibit a rich structural diversity, encompassing both periodic tilings and long-range ordered quasicrystals,…

A triangulation of a surface is k-irreducible if every non-contractible curve has length at least k and any edge contraction breaks this property. Equivalently, every edge belongs to a non-contractible curve of length k and there are no…

We prove that every locally Hamiltonian graph with $n\ge 3$ vertices and possibly with multiple edges has at least $3n-6$ edges with equality if and only if it triangulates the sphere. As a consequence, every edge-maximal embedding of a…

We show that the compressed suffix array and the compressed suffix tree for a string of length $n$ over an integer alphabet of size $\sigma\leq n$ can both be built in $O(n)$ (randomized) time using only $O(n\log\sigma)$ bits of working…

We generalize the Cartier transform of Ogus and Vologodsky to log smooth schemes. More precisely, we generalize a local version of this transform, due to Shiho, and a topos-theoretic version, due to Oyama. Let $k$ be a perfect field of…

We study the adaptation properties of the multivariate log-concave maximum likelihood estimator over three subclasses of log-concave densities. The first consists of densities with polyhedral support whose logarithms are piecewise affine.…

The field of complex self-assembly is moving toward the design of multi-particle structures consisting of thousands of distinct building blocks. To exploit the potential benefits of structures with such `addressable complexity,' we need to…

One versatile route to the creation of two-dimensional crystal structures on the nanometer to micrometer scale is the self-assembly of colloidal particles at an interface. Here, we explore the crystal phases that can be expected from the…

We show that the compressed suffix array and the compressed suffix tree of a string $T$ can be built in $O(n)$ deterministic time using $O(n\log\sigma)$ bits of space, where $n$ is the string length and $\sigma$ is the alphabet size.…

In this paper, we consider tilings of the hyperbolic 2-space, built with a finite number of polygonal tiles, up to affine transformation. To such a tiling T, we associate a space of tilings: the continuous hull Omega(T) on which the affine…

We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempts of formal analysis or programming: the planar…