Related papers: A Generalized Carpenter's Rule Theorem for Self-To…
"Flat origami" refers to the folding of flat, zero-curvature paper such that the finished object lies in a plane. Mathematically, flat origami consists of a continuous, piecewise isometric map $f:P\subseteq\mathbb{R}^2\to\mathbb{R}^2$ along…
We investigate the graphs formed from the vertices and creases of an origami pattern that can be folded flat along all of its creases. As we show, this is possible for a tree if and only if the internal vertices of the tree all have even…
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…
We revisit the field content and consistency of the New General Relativity family of theories. These theories are constructed in a geometrical framework with a flat and metric-compatible connection, so the affine structure is entirely…
We present convergence theory for corrected quadrature rules on uniform Cartesian grids for functions with a point singularity. We begin by deriving an error estimate for the punctured trapezoidal rule, and then derive error expansions. We…
We prove that the pleated hyperbolic paraboloid, a familiar origami model known since 1927, in fact cannot be folded with the standard crease pattern in the standard mathematical model of zero-thickness paper. In contrast, we show that the…
Periodic origami patterns made with repeating unit cells of creases and panels bend and twist in complex ways. In principle, such soft modes of deformation admit a simplified asymptotic description in the limit of a large number of cells.…
In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…
When can a plane graph with prescribed edge lengths and prescribed angles (from among $\{0,180^\circ, 360^\circ$\}) be folded flat to lie in an infinitesimally thin line, without crossings? This problem generalizes the classic theory of…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
A Cellular Automata (CA) rule is presented that can generate "loop patterns" in a 2D grid under fixed boundary conditions. A loop is a cyclically closed path represented by one-cells enclosed by zero-cells. A loop pattern can contain…
Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their…
Kirigami, the art of paper cutting, has become a paradigm for mechanical metamaterials in recent years. The basic building blocks of any kirigami structures are repetitive deployable patterns that derive inspiration from geometric art forms…
Crossing symmetry asserts that particles are indistinguishable from anti-particles traveling back in time. In quantum field theory, this statement translates to the long-standing conjecture that probabilities for observing the two scenarios…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
Folding paper along curves leads to spatial structures that have curved surfaces meeting at spatial creases, defined as curve-fold origami. In this work, we provide an Eulerian framework focusing on the mechanics of arbitrary curve-fold…
For cellular functions like division and polarization, protein pattern formation driven by NTPase cycles is a central spatial control strategy. Operating far from equilibrium, no general theory links microscopic reaction networks and…
A four-bar linkage is a mechanism consisting of four rigid bars which are joined by their endpoints in a polygonal chain and which can rotate freely at the joints (or vertices). We assume that the linkage lies in the 2-dimensional plane so…
In the projective plane, we consider congruences of straight lines with the combinatorics of the square grid and with all elementary quadrilaterals possessing touching inscribed conics. The inscribed conics of two combinatorially…
We develop the details of a surgery theory for contact manifolds of arbitrary dimension via convex structures, extending the 3-dimensional theory developed by Giroux. The theory is analogous to that of Weinstein manifolds in symplectic…