English
Related papers

Related papers: Folding Polyominoes with Holes into a Cube

200 papers

It is well known that to determine a triangle up to congruence requires three measurements: three sides, two sides and the included angle, or one side and two angles. We consider various generalizations of this fact to two and three…

Metric Geometry · Mathematics 2008-11-27 Alexander Borisov , Mark Dickinson , Stuart Hastings

A mathematical donut is a rectangle of integral side length with a smaller rectangle (called the hole of the donut), also of integral side length, strictly inside it and with sides of the rectangles parallel to each other, where the area of…

Number Theory · Mathematics 2024-06-04 Kevin Murawski , Neil R. Nicholson , Kathleen Walsh

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

Computational Geometry · Computer Science 2024-08-07 Mikkel Abrahamsen , Tillmann Miltzow , Nadja Seiferth

The archimedean solids Cubus simus (snub cube) and Dodecaedron simum (snub dodecahedron) cannot be constructed by ruler and compass. We explain that for general reasons their vertices can be constructed via paper folding on the faces of a…

Metric Geometry · Mathematics 2014-01-28 Urs Hartl , Klaudia Kwickert

Motivated by their role in non-perturbative potentials in string theory, we study divisors in effective cones of Calabi-Yau threefolds. We give examples of geometries for which some divisor classes in the effective cone are not themselves…

High Energy Physics - Theory · Physics 2026-03-13 Naomi Gendler , Elijah Sheridan , Michael Stillman , David H. Wu

We describe a bijection between oriented cubes and adjoints of cross-polytopes. This correspondence is used to prove that the real affine cube is, up to reorientation in the same class, the unique oriented cube that is realizable. Moreover,…

Combinatorics · Mathematics 2020-12-17 J. Lawrence , I. P. Silva

We prove that a connected bipartite graph G is a partial cube if and only if the set of attaching points of any copoint of G is convex. A consequence of this result is that any connected bipartite graph with pre-hull number at most 1 is a…

Combinatorics · Mathematics 2019-01-23 Norbert Polat

In this paper we shall find some sufficient conditions for a uniqueness polynomial to be a strong uniqueness polynomial, as this type of problem was never investigated by researchers earlier.We also exhibit some examples to substantiate our…

Complex Variables · Mathematics 2017-02-14 Abhijit Banerjee , Bikash Chakraborty

In this article we consider an open conjecture about coherently labelling a polyhedron in three dimensions. We exhibit all the forty eight possible coherent labellings of a tetrahedron. We also exhibit that some simplicial polyhedra like…

Combinatorics · Mathematics 2022-11-28 C. P. Anil Kumar

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

A recent elegant result of Akrobotu et al. states that a triangulation of any convex polyomino is word-representable if and only if it is 3-colorable. In this paper, we generalize a particular case of this result by showing that the result…

Combinatorics · Mathematics 2015-09-11 Marc Glen , Sergey Kitaev

We show that four of the five Platonic solids' surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can "zipper-refold" to a flat doubly covered parallelogram, forming a rather compact…

Computational Geometry · Computer Science 2010-10-21 Joseph O'Rourke

This addendum to [O'R17] establishes that a nearly flat acutely triangulated convex cap in the sense of that paper can be edge-unfolded even if closed to a polyhedron by adding the convex polygonal base under the cap.

Computational Geometry · Computer Science 2017-09-11 Joseph O'Rourke

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

We show that every orthogonal polyhedron of genus at most 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal…

Computational Geometry · Computer Science 2016-11-02 Mirela Damian , Erik Demaine , Robin Flatland , Joseph O'Rourke

Which convex 3D polyhedra can be obtained by gluing several regular hexagons edge-to-edge? It turns out that there are only 15 possible types of shapes, 5 of which are doubly-covered 2D polygons. We give examples for most of them, including…

Computational Geometry · Computer Science 2020-02-07 Elena Arseneva , Stefan Langerman

A conjecture of Berge suggests that every bridgeless cubic graph can have its edges covered with at most five perfect matchings. Since three perfect matchings suffice only when the graph in question is $3$-edge-colourable, the rest of cubic…

Combinatorics · Mathematics 2020-08-05 Edita Máčajová , Martin Škoviera

We consider all complex projective manifolds X that satisfy at least one of the following three conditions: 1. There exists a pair $(C ,\varphi)$, where $C$ is a compact connected Riemann surface and $\varphi : C\to X$ a holomorphic map,…

Algebraic Geometry · Mathematics 2009-01-28 Indranil Biswas

We consider a new treatment for making polyhedron nets referred to as ``apple peel unfolding'': drawing the nets as if we were peeling off appleskins. We define apple peel unfolding strictly and implement a program that derives the…

Computational Geometry · Computer Science 2026-04-20 Takashi Yoshino , Supanut Chaidee

It is well-known that a class of all modules, which are torsion-free with respect to a set of ideals, is closed under injective envelopes. In this paper, we consider a kind of a dual to this statement - are the divisibility classes closed…

Commutative Algebra · Mathematics 2018-01-09 Michal Hrbek
‹ Prev 1 4 5 6 7 8 10 Next ›