Related papers: On Folding a Polygon to a Polyhedron
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
It has been known since 1996 that deciding whether a collection of creases on a piece of paper can be fully folded flat without causing self-intersection or adding new creases is an NP-Hard problem (Bern and Hayes). In their proof, a binary…
Firstly, we provide a different proof of an important lemma in Buzzard and Calegari's work on slopes of overconvergent 2-adic modular forms via nonarchimedean linear Hodge-Newton decomposition. The lemma shows that two equivalent matrices…
Rigid origami, with applications ranging from nano-robots to unfolding solar sails in space, describes when a material is folded along straight crease line segments while keeping the regions between the creases planar. Prior work has found…
This is a reference volume on polyfold and Fredholm theory.
A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a $O(n\log^2{n})$-time algorithm for deciding if a…
Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
The use of origami in engineering has significantly expanded in recent years, spanning deployable structures across scales, folding robotics, and mechanical metamaterials. However, finding foldable paths can be a formidable task as the…
We present a collection of observations and results concerning submeasures on Boolean algebras. They are all motivated by Maharam's problem and Talagrand's construction that solved it.
We study the problem of folding a polyomino $P$ into a polycube $Q$, allowing faces of $Q$ to be covered multiple times. First, we define a variety of folding models according to whether the folds (a) must be along grid lines of $P$ or can…
We consider the zero-energy deformations of periodic origami sheets with generic crease patterns. Using a mapping from the linear folding motions of such sheets to force-bearing modes in conjunction with the Maxwell-Calladine index theorem…
Some Open Problems Concerning Orthogonal Polynomials.
We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…
We extend to infinite dimensional Hilbert spaces a celebrated result, due to B. Polyak, about the convexity of the joint image of quadratic functions. We give sufficient conditions which assure that the joint image is also closed. However,…
We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in…
The art and science of folding intricate three-dimensional structures out of paper has occupied artists, designers, engineers, and mathematicians for decades, culminating in the design of deployable structures and mechanical metamaterials.…
This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a…
We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…
This work presents for the first time a solution to the 1821 unsolved Sawa Masayoshi's problem, giving an explicit and algebraically exact solution for the symmetric case (particular case b = c, i.e., ABC \equiv right-angled isosceles…