相关论文: Hinged Dissection of Polyominoes and Polyforms

The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of…

An example of reversible (or hinge inside-out transformable) figures is the Dudeney's Haberdasher's puzzle in which an equilateral triangle is dissected into four pieces, then hinged like a chain, and then is transformed into a square by…

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…

`Gluing' is a technique of constructing solutions to non-linear (elliptic) partial differential equations such as Yang--Mills equations, minimal surface equations and Einstein equations. Calibrated submanifolds are a certain class of…

The main purpose of this paper is to show that the mixed Hodge polynomial of the ``space of equations'' for smooth complete intersections of given multidegree in $\mathbb{C} P^n$ is divisible by the mixed Hodge polynomial of the group…

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

One approach to produce a pair of homeomorphic-but-not-diffeomophic closed 4-manifolds is to find a knot which is smoothly slice in one but not the other. This approach has never been run successfully. We give the first examples of a pair…

It is unknown whether every polycube (polyhedron constructed by gluing cubes face-to-face) has an edge unfolding, that is, cuts along edges of the cubes that unfolds the polycube to a single nonoverlapping polygon in the plane. Here we…

We prove that every positively-weighted tree T can be realized as the cut locus C(x) of a point x on a convex polyhedron P, with T weights matching C(x) lengths. If T has n leaves, P has (in general) n+1 vertices. We show there are in fact…

This paper is the fifth and final in a series on embedded minimal surfaces. Following our earlier papers on disks, we prove here two main structure theorems for non-simply connected embedded minimal surfaces of any given fixed genus. The…

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

The image of a polygonal knot K under a spherical inversion of R^3 (union infinity) is a simple closed curve made of arcs of circles, having the same knot type as the mirror image of K. Suppose we reconnect the vertices of the inverted…

Pilgrim's Finite Global Attractor Conjecture has been verified for polynomials [1], but remains open for general rational maps. In this paper, we prove the conjecture for a family of rational maps obtained by gluing two PCF polynomials…

We prove that, in all dimensions d>=4, every simple open polygonal chain and every tree may be straightened, and every simple closed polygonal chain may be convexified. These reconfigurations can be achieved by algorithms that use…

Generalizing pseudospherical drawings, we introduce a new class of simple drawings, which we call separable drawings. In a separable drawing, every edge can be closed to a simple curve that intersects each other edge at most once. Curves of…

We prove that the number of dissections of a given polygon into triangles with fixed areas of faces is finite and that an equidissection is algebraic as long as the vertices of the original polygon have algebraic coordinates.

Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…

Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…

It is well-known that every isosceles tetrahedron (disphenoid) admits infinitely many simple closed geodesics on its surface. They can be naturally enumerated by pairs of co-prime integers $n > m > 1$ with two additional cases $(1,0)$ and…

A cusp-decomposable manifold is a manifold constructed from a finite number of complete, negatively curved, finite volume manifolds and identifying the boundaries of truncated cusps by diffeomorphisms. Using properties of the electric space…