ﻻ يوجد ملخص باللغة العربية
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form any polygon in the collection. This result settles the open problem about the existence of hinged dissections between pairs of polygons that goes back implicitly to 1864 and has been studied extensively in the past ten years. Our result generalizes and indeed builds upon the result from 1814 that polygons have common dissections (without hinges). We also extend our common dissection result to edge-hinged dissections of solid 3D polyhedra that have a common (unhinged) dissection, as determined by Dehns 1900 solution to Hilberts Third Problem. Our proofs are constructive, giving explicit algorithms in all cases. For a constant number of planar polygons, both the number of pieces and running time required by our construction are pseudopolynomial. This bound is the best possible, even for unhinged dissections. Hinged dissections have possible applications to reconfigurable robotics, programmable matter, and nanomanufacturing.
Let $P$ be a set of $2n$ points in convex position, such that $n$ points are colored red and $n$ points are colored blue. A non-crossing alternating path on $P$ of length $ell$ is a sequence $p_1, dots, p_ell$ of $ell$ points from $P$ so that (i) all
Monskys celebrated equidissection theorem follows from his more general proof of the existence of a polynomial relation $f$ among the areas of the triangles in a dissection of the unit square. More recently, the authors studied a different polynomial
Existing studies for environment interaction with an aerial robot have been focused on interaction with static surroundings. However, to fully explore the concept of an aerial manipulation, interaction with moving structures should also be considered
We study a $2 times 2$ matrix equation arising naturally in the theory of Coxeter frieze patterns. It is formulated in terms of the generators of the group $mathrm{PSL}(2,mathbb{Z})$ and is closely related to continued fractions. It appears in a numb
Does regulation in the genome use collective behavior, similar to the way the brain or deep neural networks operate? Here I make the case for why having a genomic network capable of a high level of computation would be strongly selected for, and sugg