English
Related papers

Related papers: Folding Polyominoes into (Poly)Cubes

200 papers

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library…

Logic in Computer Science · Computer Science 2023-06-22 Xavier Allamigeon , Ricardo D. Katz , Pierre-Yves Strub

We show that packing axis-aligned unit squares into a simple polygon $P$ is NP-hard, even when $P$ is an orthogonal and orthogonally convex polygon with half-integer coordinates. It has been known since the early 80s that packing unit…

Computational Geometry · Computer Science 2024-04-19 Mikkel Abrahamsen , Jack Stade

We prove that the answer to the question of the title is `as many times as you want.' More precisely, given any constant $c>0$, we construct two oblique triangular bipyramids, $P$ and $Q$, such that $P$ is convex, $Q$ is nonconvex and…

Metric Geometry · Mathematics 2017-08-08 Victor Alexandrov

It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…

Optimization and Control · Mathematics 2021-06-14 Yibo Xu , Warren Adams , Akshay Gupte

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

A planar set $P$ is said to be cover-decomposable if there is a constant $k=k(P)$ such that every $k$-fold covering of the plane with translates of $P$ can be decomposed into two coverings. It is known that open convex polygons are…

Metric Geometry · Mathematics 2014-03-12 István Kovács , Géza Tóth

Let $\mathrm{PG}(3,q)$ be the projective space of dimension three over the finite field with $q$ elements. Consider a twisted cubic in $\mathrm{PG}(3,q)$. The structure of the point-plane incidence matrix in $\mathrm{PG}(3,q)$ with respect…

Combinatorics · Mathematics 2020-03-03 Daniele Bartoli , Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…

Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…

History and Overview · Mathematics 2011-06-07 Jorge Rezende

A family of closed manifolds is called cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. We establish cohomological rigidity for large families of 3-dimensional and…

Algebraic Topology · Mathematics 2017-07-25 Victor Buchstaber , Nikolay Erokhovets , Mikiya Masuda , Taras Panov , Seonjeong Park

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

We show that any polyhedron forming a topological ball with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face to face. The result generalizes to non-simply-connected polyhedra satisfying an…

Computational Geometry · Computer Science 2010-01-21 David Eppstein

A Newton-Okounkov polytope of a complete flag variety can be turned into a convex geometric model for Schubert calculus. Namely, we can represent Schubert cycles by linear combinations of faces of the polytope so that the intersection…

Algebraic Geometry · Mathematics 2018-12-12 Valentina Kiritchenko , Maria Padalko

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

Computational Geometry · Computer Science 2024-12-20 Erik D. Demaine , Martin L. Demaine , Markus Hecher , Rebecca Lin , Victor H. Luo , Chie Nara

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

Combinatorics · Mathematics 2024-11-05 Hugo Akitaya , Jean Cardinal , Stefan Felsner , Linda Kleist , Robert Lauff

We study Calabi-Yau manifolds constructed as double covers of ${\mathbb P}^3$ branched along an octic surface. We give a list of 85 examples corresponding to arrangements of eight planes defined over ${\mathbb Q}$. The Hodge numbers are…

Algebraic Geometry · Mathematics 2009-12-15 S. Cynk , C. Meyer

Can folding a piece of paper flat make it larger? We explore whether a shape $S$ must be scaled to cover a flat-folded copy of itself. We consider both single folds and arbitrary folds (continuous piecewise isometries $S\rightarrow R^2$).…

It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…

General Mathematics · Mathematics 2007-05-23 Sergey Nikitin

To each local field (including the real or complex numbers) we associate a quantum dilogarithm and show that it satisfies a pentagon identity and some symmetries. Using an angled version of these quantum dilogarithms, we construct three…

Geometric Topology · Mathematics 2023-06-06 Stavros Garoufalidis , Rinat Kashaev