English
Related papers

Related papers: The pyramidal growth

200 papers

We show that several classes of polyhedra are joined by a sequence of O(1) refolding steps, where each refolding step unfolds the current polyhedron (allowing cuts anywhere on the surface and allowing overlap) and folds that unfolding into…

Computational Geometry · Computer Science 2023-10-27 Erik D. Demaine , Martin L. Demaine , Jenny Diomidova , Tonan Kamata , Ryuhei Uehara , Hanyu Alice Zhang

A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…

Combinatorics · Mathematics 2021-08-16 Andrew Newman

The mixing operation for abstract polytopes gives a natural way to construct the minimal common cover of two polytopes. In this paper, we apply this construction to the regular convex polytopes, determining when the mix is again a polytope,…

Combinatorics · Mathematics 2012-01-17 Gabe Cunningham

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Computational Geometry · Computer Science 2021-06-01 Tonan Kamata , Akira Kadoguchi , Takashi Horiyama , Ryuhei Uehara

Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the same combinatorial structure as convex polyhedra. In…

Computational Geometry · Computer Science 2007-05-23 Marshall Bern , Erik D. Demaine , David Eppstein , Eric Kuo , Andrea Mantler , Jack Snoeyink

We show that up to unimodular equivalence there are only finitely many d-dimensional lattice polytopes without interior lattice points that do not admit a lattice projection onto a (d-1)-dimensional lattice polytope without interior lattice…

Combinatorics · Mathematics 2011-04-26 Benjamin Nill , Günter M. Ziegler

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

It is shown that each quadrangulation of the 2-torus by the Cartesian product of two cycles can be geometrically realized in (Euclidean) 4-space without hidden symmetries---that is, so that each combinatorial cellular automorphism of the…

Metric Geometry · Mathematics 2014-09-16 Serge Lawrencenko

The aim of this paper is the determination of the largest $n$-dimensional polytope with $n+3$ vertices of unit diameter. This is a special case of a more general problem proposed by Graham.

Combinatorics · Mathematics 2007-05-23 Andreas Klein , Markus Wessler

We study polyiamonds (polygons arising from the triangular grid) that fold into the smallest yet unstudied platonic solid -- the octahedron. We show a number of results. Firstly, we characterize foldable polyiamonds containing a hole of…

Computational Geometry · Computer Science 2022-07-29 Eva Stehr , Linda Kleist

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

Metric Geometry · Mathematics 2010-06-29 L. Hakova , M. Larouche , J. Patera

We generalize the theorems in {\it Mirror Principle I} and {\it II} to the case of general projective manifolds without the convexity assumption. We also apply the results to balloon manifolds, and generalize to higher genus.

Algebraic Geometry · Mathematics 2007-05-23 B. Lian , K. Liu , S. T. Yau

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

Metric Geometry · Mathematics 2022-01-06 Panos Papasoglu

We give explicit recursive constructions for the polytope of all matroids $\Omega_{r,n}$ in ranks 2 and 3 for all ground set sizes. This polytope was introduced in recent work by Ferroni and Fink as a tool for checking positivity…

Combinatorics · Mathematics 2026-05-13 Narayan Collins , Victoria Schleis

The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…

High Energy Physics - Theory · Physics 2017-08-22 Michael Enciso

We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding…

Computational Geometry · Computer Science 2024-09-19 Erik D. Demaine , Stefan Langerman

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

It is known that the volume function for hyperbolic manifolds of dimension $\geq 3$ is finite-to-one. We show that the number of nonhomeomorphic hyperbolic 4-manifolds with the same volume can be made arbitrarily large. This is done by…

Geometric Topology · Mathematics 2016-09-07 Dubravko Ivanšić

Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…

Number Theory · Mathematics 2025-09-16 Thian Tromp

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…

Metric Geometry · Mathematics 2009-09-29 Julian Pfeifle