English
Related papers

Related papers: Folding Polyominoes with Holes into a Cube

200 papers

One unsolved mathematical problem remains the perfect cuboid problem. A perfect cuboid is a rectangular parallelepiped whose edges, face diagonals and space diagonal are all expressed as integers. No such cuboid has yet been discovered and…

Number Theory · Mathematics 2022-03-03 Natalia Aleshkevich

A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…

Given a manifold M, it is natural to ask in how many ways it fibers (we mean fibering in a general way, where the base might be an orbifold -- this could be described as Seifert fibering)There are group-theoretic obstructions to the…

Geometric Topology · Mathematics 2011-07-05 Igor Rivin

This paper focuses on packaging design using origami techniques, specifically designs incorporating curves, known as pillow boxes. While conventional paper packaging boxes are typically cuboid, pillow box designs include curved surfaces,…

Computational Geometry · Computer Science 2024-10-24 Jun Mitani

We present a universal crease pattern--known in geometry as the tetrakis tiling and in origami as box pleating--that can fold into any object made up of unit cubes joined face-to-face (polycubes). More precisely, there is one universal…

Computational Geometry · Computer Science 2009-09-30 Nadia Benbernou , Erik D. Demaine , Martin L. Demaine , Aviv Ovadya

Ghomi proved that every convex polyhedron could be stretched via an affine transformation so that it has an edge-unfolding to a net [Gho14]. A net is a simple planar polygon; in particular, it does not self-overlap. One can view his result…

Computational Geometry · Computer Science 2023-02-17 Joseph O'Rourke

In this paper, we disprove a conjecture recently proposed in [L. Almodovar et al., arXiv:2108.00035] on the non-existence of biminimal pots realizing the cube, namely pots with the minimum number of tiles and the minimum number of bond-edge…

Combinatorics · Mathematics 2022-10-28 M. M. Ferrari , A. Pasotti , T. Traetta

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

Classical Analysis and ODEs · Mathematics 2018-01-10 Han Yu

Grid polyominoes form a class of thin polyominoes with one or more holes arranged in a grid-like pattern in the plane. In this paper, we prove that the rook polynomial of grid polyominoes coincides with the h-polynomial of their…

Combinatorics · Mathematics 2026-03-10 Rodica Dinu , Francesco Navarra

An unzipping of a polyhedron P is a cut-path through its vertices that unfolds P to a non-overlapping shape in the plane. It is an open problem to decide if every convex P has an unzipping. Here we show that there are nearly flat convex…

Computational Geometry · Computer Science 2018-02-07 Joseph O'Rourke

Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…

Metric Geometry · Mathematics 2025-09-03 Robert Connelly , Zhen Zhang

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

We prove that for any convex polygon $S$ with at least four sides, or a concave one with no parallel sides, and any $m>0$, there is an $m$-fold covering of the plane with homothetic copies of $S$ that cannot be decomposed into two…

Computational Geometry · Computer Science 2015-03-13 István Kovács

Given a palette of six colors, a colored cube is a cube where each face is colored with exactly one color and each color appears on some face. Starting with an arbitrary collection of unit length colored cubes, one can try to arrange a…

Combinatorics · Mathematics 2015-03-26 Ethan Berkove , David Cervantes Nava , Daniel Condon , Rachel Katz

Let $G$ be a connected reductive group. We find a necessary and sufficient condition for a quasiaffine homogeneous space of $G$ to be embeddable into an irreducible $G$-module. In addition, for an affine homogeneous space we find a…

Representation Theory · Mathematics 2010-06-03 Ivan V. Losev

We obtain a sufficient condition for a Fano threefold with terminal singularities to have a conic bundle structure.

Algebraic Geometry · Mathematics 2022-02-02 Yuri Prokhorov

The first undecidability result on the tiling is the undecidability of translational tiling of the plane with Wang tiles, where there is an additional color matching requirement. Later, researchers obtained several undecidability results on…

Combinatorics · Mathematics 2025-06-17 Chao Yang , Zhujun Zhang

Recently, Greenfeld and Tao disprove the conjecture that translational tilings of a single tile can always be periodic [Ann. Math. 200(2024), 301-363]. In another paper [to appear in J. Eur. Math. Soc.], they also show that if the dimension…

Combinatorics · Mathematics 2025-04-10 Chao Yang , Zhujun Zhang

This article extends the range of 1-DOF rigid-foldable developable quadrilateral creased papers. In a previous article, we put forward a sufficient and necessary condition for a quadrilateral creased paper to be rigid-foldable, and…

Metric Geometry · Mathematics 2020-06-15 Zeyuan He , Simon D. Guest

A collection of unit cubes with integer coordinates in $\mathbb R^3$ is an animal if its union is homeomorphic to the 3-ball. Pach's animal problem asks whether any animal can be transformed to a single cube by adding or removing cubes one…

Combinatorics · Mathematics 2024-02-29 Martin Tancer