Jamming Percolation in Three Dimensions

We introduce a three-dimensional model for jamming and glasses, and prove that the fraction of frozen particles is discontinuous at the directed-percolation critical density. In agreement with the accepted scenario for jamming- and glass-transitions, this is a mixed-order transition; the discontinuity is accompanied by diverging length- and time-scales. Because one-dimensional directed-percolation paths comprise the backbone of frozen particles, the unfrozen rattlers may use the third dimension to travel between their cages. Thus the dynamics are diffusive on long-times even above the critical density for jamming.Comment: 6 pages, 6 figure

Hierarchical Partial Planarity

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets of edges is biconnected. We also discuss interesting relationships with other constrained-planarity problems.Comment: Conference version appeared in WG201

The Complexity of Drawing Graphs on Few Lines and Few Planes

It is well known that any graph admits a crossing-free straight-line drawing in $\mathbb{R}^3$ and that any planar graph admits the same even in $\mathbb{R}^2$. For a graph $G$ and $d \in \{2,3\}$, let $\rho^1_d(G)$ denote the minimum number of lines in $\mathbb{R}^d$ that together can cover all edges of a drawing of $G$. For $d=2$, $G$ must be planar. We investigate the complexity of computing these parameters and obtain the following hardness and algorithmic results. - For $d\in\{2,3\}$, we prove that deciding whether $\rho^1_d(G)\le k$ for a given graph $G$ and integer $k$ is ${\exists\mathbb{R}}$-complete. - Since $\mathrm{NP}\subseteq{\exists\mathbb{R}}$, deciding $\rho^1_d(G)\le k$ is NP-hard for $d\in\{2,3\}$. On the positive side, we show that the problem is fixed-parameter tractable with respect to $k$. - Since ${\exists\mathbb{R}}\subseteq\mathrm{PSPACE}$, both $\rho^1_2(G)$ and $\rho^1_3(G)$ are computable in polynomial space. On the negative side, we show that drawings that are optimal with respect to $\rho^1_2$ or $\rho^1_3$ sometimes require irrational coordinates. - Let $\rho^2_3(G)$ be the minimum number of planes in $\mathbb{R}^3$ needed to cover a straight-line drawing of a graph $G$. We prove that deciding whether $\rho^2_3(G)\le k$ is NP-hard for any fixed $k \ge 2$. Hence, the problem is not fixed-parameter tractable with respect to $k$ unless $\mathrm{P}=\mathrm{NP}$

Design of DNA origami

The generation of arbitrary patterns and shapes at very small scales is at the heart of our effort to miniaturize circuits and is fundamental to the development of nanotechnology. Here I review a recently developed method for folding long single strands of DNA into arbitrary two-dimensional shapes using a raster fill technique - 'scaffolded DNA origami'. Shapes up to 100 nanometers in diameter can be approximated with a resolution of 6 nanometers and decorated with patterns of roughly 200 binary pixels at the same resolution. Experimentally verified by the creation of a dozen shapes and patterns, the method is easy, high yield, and lends itself well to automated design and manufacture. So far, CAD tools for scaffolded DNA origami are simple, require hand-design of the folding path, and are restricted to two dimensional designs. If the method gains wide acceptance, better CAD tools will be required