English
Related papers

Related papers: Folding Polyominoes into (Poly)Cubes

200 papers

We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…

Computational Geometry · Computer Science 2019-01-25 Hugo A. Akitaya , Cordelia Avery , Joseph Bergeron , Erik D. Demaine , Justin Kopinsky , Jason Ku

We classify all closed non-orientable $\mathbb{P}^2$-irreducible 3-manifolds obtained by identifying the faces of a cube. These turn out to be the closed non-orientable $\mathbb{P}^2$-irreducible 3-manifolds with surface-complexity one. We…

Geometric Topology · Mathematics 2025-01-03 Gennaro Amendola

If all tiles in a tiling are congruent, the tiling is called monohedral. Tiling by convex polygons is called edge-to-edge if any two convex polygons are either disjoint or share one vertex or one entire edge in common. In this paper, we…

Metric Geometry · Mathematics 2017-12-27 Teruhisa Sugimoto

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…

Geometric Topology · Mathematics 2025-09-30 Daniel V. Mathews , Orion Zymaris

We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time…

Computational Geometry · Computer Science 2021-11-30 Stefan Langerman , Nicolas Potvin , Boris Zolotov

It is well known that linear rank-metric codes give rise to q-polymatroids. Analogously to matroid theory one may ask whether a given q-polymatroid is representable by a rank-metric code. We provide an answer by presenting an example of a…

Information Theory · Computer Science 2022-03-14 Heide Gluesing-Luerssen , Benjamin Jany

We formalize the ``metric bundle'' viewpoint by defining, for any smooth $n$--manifold $M$, the open fiberwise cones $\mathcal{G}^{p,q}\subset S^2\Tstar M$ of nondegenerate symmetric bilinear forms with fixed signature $(p,q)$, and we…

Differential Geometry · Mathematics 2025-10-21 Shouvik Datta Choudhury

This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…

Combinatorics · Mathematics 2008-11-27 Mireille Bousquet-Mélou , Richard Brak

We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cube polytope studied in previous works. This…

Geometric Topology · Mathematics 2014-10-01 R. M. Green , Jacob T. Harper

We give a complete description of all convex polyhedra whose surface can be constructed from several congruent regular pentagons by folding and gluing them edge to edge. Our method of determining the graph structure of the polyhedra from a…

Computational Geometry · Computer Science 2020-07-06 Elena Arseneva , Stefan Langerman , Boris Zolotov

In this paper, we study boundedness questions for (simply-connected) smooth Calabi-Yau threefolds. The diffeomorphism class of such a threefold is known to be determined up to finitely many possibilities by the integral middle cohomology…

Algebraic Geometry · Mathematics 2023-04-26 P. M. H. Wilson

Motivated by a search for Lie group structures on groups of Poisson diffeomorphisms [24], we investigate linearizability of Poisson structures of Poisson groupoids around the unit section. After extending the Lagrangian neighbourhood…

Differential Geometry · Mathematics 2022-12-09 Wilmer Smilde

Given a chain of $HW$ cubes where each cube is marked "turn $90^\circ$" or "go straight", when can it fold into a $1 \times H \times W$ rectangular box? We prove several variants of this (still) open problem NP-hard: (1) allowing some cubes…

Computational Complexity · Computer Science 2024-07-16 MIT Hardness Group , Nithid Anchaleenukoon , Alex Dang , Erik D. Demaine , Kaylee Ji , Pitchayut Saengrungkongka

Exactly solvable two-dimensional polygon models, counted by perimeter and area, are described by $q$-algebraic functional equations. We provide techniques to extract the scaling behaviour of these models up to arbitrary order and apply them…

Statistical Mechanics · Physics 2008-08-28 Christoph Richard

We classify special self-birational transformations of the smooth quadric threefold and fourfold, $Q^3$ and $Q^4$. It turns out that there is only one such example in each dimension. In the case of $Q^3$, it is given by the linear system of…

Algebraic Geometry · Mathematics 2024-07-17 Jordi Hernández

We investigate an idealized model for the size reduction and smoothing of a polygonal rock due to repeated chipping at corners. Each chip is sufficiently small so that only a single corner and a fraction of its two adjacent sides are cut…

Statistical Mechanics · Physics 2008-04-23 P. L. Krapivsky , S. Redner

We generalize the notion of moment-angle manifold over a simple convex polytope to an arbitrary nice manifold with corners. For a nice manifold with corners Q, we first compute the stable decomposition of the moment-angle manifold Z_Q via a…

Algebraic Topology · Mathematics 2024-03-27 Li Yu

We survey results on the foldability of flat origami models. The main topics are the question of when a given crease pattern can fold flat, the combinatorics of mountain and valley creases, and counting how many ways a given crease pattern…

Metric Geometry · Mathematics 2013-07-04 Thomas C. Hull

We introduce a computational origami problem which we call the segment folding problem: given a set of $n$ line-segments in the plane the aim is to make creases along all segments in the minimum number of folding steps. Note that a folding…

Computational Geometry · Computer Science 2022-01-17 Takashi Horiyama , Fabian Klute , Matias Korman , Irene Parada , Ryuhei Uehara , Katsuhisa Yamanaka

It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…

Combinatorics · Mathematics 2007-05-23 Cristopher Moore , John Michael Robson
‹ Prev 1 8 9 10 Next ›