Related papers: Folding $\pi$
All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
We study the three-dimensional equilibrium shape of a shell formed by a deployed accordion-like origami, made from an elastic sheet decorated by a series of parallel creases crossed by a central longitudinal crease. Surprisingly, while the…
In this paper we prove that $\Pi$-projective spaces $\mathbb{P}^n_\Pi$ arise naturally in supergeometry upon considering a non-projected thickening of $\mathbb{P}^n$ related to the cotangent sheaf $\Omega^1_{\mathbb{P}^n}$. In particular,…
We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…
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…
When the sequence of regular polygons with consecutively increasing numbers of sides is joined edge-to-edge in a single direction while minimizing bending, the resulting structure assumes the shape of a logarithmic spiral. This paper proves…
We present a method which allows the combination of forcing uniformization on the $\Pi$- and the $\Sigma$-side of the projective hierarchy to a certain extent. Using this method we construct a universe where ${\Pi}^1_3$-reduction holds,…
In this paper we show how to construct new convolutional codes from old ones by applying the well-known techniques: puncturing, extending, expanding, direct sum, the (u|u + v) construction and the product code construction. By applying…
A matrix algebra is constructed which consists of the necessary degrees of freedom for a finite approximation to the algebra of functions on the family of orthogonal Grassmannians of real dimension 2N, known as complex quadrics. These…
Convex hulls are fundamental objects in computational geometry. In moderate dimensions or for large numbers of vertices, computing the convex hull can be impractical due to the computational complexity of convex hull algorithms. In this…
Any space-filling packing of spheres can be cut by a plane to obtain a space-filling packing of disks. Here, we deal with space-filling packings generated using inversive geometry leading to exactly self-similar fractal packings. First, we…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
Self-folding origami, structures that are engineered flat to fold into targeted, three-dimensional shapes, have many potential engineering applications. Though significant effort in recent years has been devoted to designing fold patterns…
We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…
We characterize the phase-space of all Helical Miura Origami. These structures are obtained by taking a partially folded Miura parallelogram as the unit cell, applying a generic helical or rod group to the cell, and characterizing all the…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We point out that the recursive formula that appears in Erickson's presentation "Fusible Numbers" is incorrect, and pose an alternate conjecture about the structure of fusible numbers. Although we are unable to solve the conjecture, we…
A number of constructions in function field arithmetic involve extensions from linear objects using digit expansions. This technique is described here as a method of constructing orthonormal bases in spaces of continuous functions. We…
This paper shows that how to approximate general fuzzy number by using convolution method.