Questions tagged [polyhedra]
The polyhedra tag has no usage guidance.
249
questions
5
votes
1
answer
188
views
Orienting the dual of the associahedron
Let $A_n$ be the dual simplicial complex to the associahedron on $n$ letters. The complex $A_n$ is thus a simplicial triangulation of an $(n-3)$-dimensional sphere. The vertices of $A_n$ correspond ...
7
votes
1
answer
120
views
Is it possible for the dihedral angles of a polyhedron to all grow simultaneously?
(Originally on MSE.)
Suppose $P$ and $Q$ are combinatorially equivalent non-self-intersecting polyhedra in $\mathbb{R}^3$, with $f$ a map from edges of $P$ to edges of $Q$ under said combinatorial ...
1
vote
0
answers
46
views
Enumeration of uniform polyhedra
[I already asked this question on MSE (here) but got no answer so I am trying here]
It is known that there are two infinite classes of polyhedra (prisms and antiprisms) together with $75$ uniform ...
3
votes
1
answer
126
views
Bounding distance to an intersection of polyhedra
Let $P$ and $Q$ be polyhedra in ${\mathbb R}^m$ with a non-empty intersection. I believe there should exist a constant $C_{PQ}>0$ such that for any point $x\in {\mathbb R}^m$ the following ...
3
votes
2
answers
166
views
Bounding distance to a polyhedron
I need to estimate the Euclidean distance from a point $x\in {\mathbb R}^m$ to a polyhedron $P\subset {\mathbb R}^m$ in terms of distances from $x$ to the tangent hyperplanes which define $P$. By a ...
0
votes
1
answer
104
views
4 triangular faces 6 vertices not tetrahedron [closed]
I have made a solid and would like to know its' name, volume and related formulas. It is made using a flat potato chip bag. The end opposite the factory seal is sealed perpendicular to the factory ...
13
votes
3
answers
658
views
Are there Monohedra with odd numbers of faces?
A monohedron is a convex polyhedron with all faces mutually congruent but with no other symmetry necessarily needed. So obviously, this is a wide class of polyhedra that includes the Platonic solids ...
2
votes
1
answer
82
views
Is there a way to parametrize the configuration space of all convex polyhedra of a given combinatorial type as a convex set?
I'm sure this is easy/known, but I'm not hitting an appropriate search term for finding the answer and the coffee hasn't kicked in enough to come up with it myself:
Let $T$ be a simplicial 2-complex ...
11
votes
1
answer
518
views
How to correctly state Cauchy's rigidity theorem?
Cauchy's rigidity theorem is usually cites briefly as
Any two (convex, 3-dimensional) polyhedra with pairwise congruent faces are themselves congruent.
As a more formal generalization to general ...
10
votes
3
answers
3k
views
polyhedra with equilateral pentagons faces
In page http://loki3.com/poly/isohedra.html around six polyhedra with equilateral pentagons as faces are shown: a pyritohedron, icositetrahedrons... Is there a complete list of this kind of polyhedra? ...
12
votes
12
answers
1k
views
Database of integer edge lengths that can form tetrahedrons
Is there a collection of lists of six integer edge lengths that form a tetrahedron? Is there a computer program for generating such lists? I need to find approximately thirty such tetrahedral ...
4
votes
3
answers
922
views
Is there a pyramid with all four faces being right triangles? [closed]
If such a pyramid exists, could someone provide the coordinates of its vertices?
1
vote
0
answers
80
views
A face and all its neighbors: terminology?
Suppose $F$ is a face of a 2-complex, and $F_1,\dotsc,F_n$ are the faces that are adjacent to (i.e., share an edge with) $F$. Is there a standard term for a collection of faces of the form $\{F,F_1,\...
5
votes
1
answer
184
views
Regular polyhedral spaces
By symmetrically gluing together opposite faces of a dodecahedron together, one of three spaces can be obtained, depending on the angle the faces are rotated by before twisting. In fact, this can be ...
10
votes
1
answer
3k
views
Computionally efficient vertex enumeration for (convex) polytopes
Let $P \subseteq \mathbb{R}^d$ be an $\mathcal{H}$-polytope. The vertex enumeration problem asks for the set of vertices $V$ of $P$. Theoretically, the vertex enumeration problem for $P$ can be ...
2
votes
0
answers
240
views
Why is it impossible to create a numerically balanced die with more than 120 sides?
I allow myself to contact you as a mathematics enthusiast. I have recently been intrigued by the concept of balance in dice and the assertion that it would be impossible to create a numerically ...
9
votes
2
answers
313
views
Are there centrally-symmetric self-dual polytopes in dimension $d> 4$?
A convex polytope $P\subset\Bbb R^d$ is centrally symmetric if $-P=P$. It is self-dual (or better, self-polar?) if its polar dual $P^\circ$ is congruent to $P$, that is, there is a map $X\in\mathrm O(\...
0
votes
1
answer
139
views
Which simplicial complexes are completely determined by the 1-skeleton of their dual polyhedral complexes?
Consider the following line of reasoning that shows certain simplicial complexes (of arbitrary dimension) are completely determined by corresponding graphs:
The facet complex of any simplicial ...
1
vote
0
answers
177
views
Does this sequence stop?
Let $\{ X_i\}$ ($i=1,2,\ldots $) be a family finite CW-complexes such that $X_{i+1}$ is homotopy domintaed by $X_i$, i.e. there exists contionuos maps $g_i:X_i \to X_{i+1}$ and $f_i :X_{i+1} \to X_i$ ...
0
votes
1
answer
114
views
How can I find the hyperplane passing through a 600-cell
I have a 600-cell, whose coordinates are given by
$$\begin{array}{ccc}
\text{8 vertices} & \left(0,0,0,\pm1\right) & \text{all permutations,}\\
\text{16 vertices} & \frac{1}{2}\left(\pm1,\...
2
votes
2
answers
1k
views
Mathematical tools appropriate to analyse convex polyhedra
What mathematical tools (means: set of areas of mathematical knowledge) are appropriate to begin with to analyse (to enumerate face vectors associated with polyhedron, to calculate the combinatorial ...
1
vote
0
answers
29
views
Inside-out dissections of solids
We add to Inside-out dissections of polygons - a generalization. The inside-out (fully inside-out) dissections are defined on pages linked there.
How does one inside-out dissect a tetrahedron into ...
13
votes
2
answers
3k
views
How many vertices/edges/faces at most for a convex polyhedron that tiles space?
I wonder if this problem has already been examined before:
Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have?
...
1
vote
0
answers
39
views
About the number of faces of the conification of a polytope
Let $P\subset\mathbb{R}^n$ be a polytope of dimension $(n-1)$ such that the origin $\vec{0}\not\in\text{Aff}(P)$, where $\text{Aff}(P)$ denotes the affine hull of $P$ in $\mathbb{R}^n$. Now, we ...
5
votes
1
answer
203
views
The bounded complex of a polyhedral decomposition
Let $\mathscr{P}$ be a polyhedral decomposition of a real vector space $V$. By that I mean that $\mathscr{P}$ is a finite set of polyhedra in $V$ satisfying the following three properties:
The union ...
1
vote
0
answers
114
views
What is the difference between a simple polyhedron and a triangulated graph?
On a famous website I've seen the following:
The skeletons of the simple polyhedra correspond to the triangulated graphs, the smallest of which are illustrated above. That "illustration above&...
1
vote
0
answers
26
views
Does Hoffman constant keep the same after a very tiny perturbation on the polyhedron such that the bases are even unchanegd?
Suppose that $P$ is a polyhedron represented by
$$P:=\{x \in \mathbb{R}^n: A x \le b \} \text{ for }A \in \mathbb{R}^{m\times n},\ b \in \mathbb{R}^m,$$
and $P$ contains interior points. Moreover, the ...
96
votes
4
answers
5k
views
A curious relation between angles and lengths of edges of a tetrahedron
Consider a Euclidean tetrahedron with lengths of edges
$$
l_{12}, l_{13}, l_{14}, l_{23}, l_{24}, l_{34}
$$
and dihedral angles
$$
\alpha_{12}, \alpha_{13}, \alpha_{14},
\alpha_{23}, \alpha_{24}, \...
2
votes
1
answer
66
views
Generic infinitesimal rigidity of polyhedra
Let $M$ be a 1-skeleton of a triangulation of a sphere with $V$ vertices and $E$ edges.
Definition 1 A polyhedron is a map $M\to \mathbb R^3$ that is affine on edges (and non-degenerate on faces). The ...
2
votes
0
answers
82
views
Is it possible to deduce Poincaré duality from duality of polytopes?
I'm having trouble understanding Poincaré duality, as it seems unmotivated. Here for instance:
https://math.stackexchange.com/a/14469/454016
Poincaré duality is explained through a duality of ...
16
votes
3
answers
1k
views
If I have zeros at the vertices of an icosahedron, where should the poles go?
I've been tinkering with Newton's method applied to polynomials. E.g., Newton's method for $z^5 - 1 = 0$ gives:
There aren't a lot of symmetric patterns of finite sets of points in the plane, so I ...
1
vote
1
answer
90
views
Intersection of conical neighbourhoods on a polyhedral space
Let $P$ be a non-negatively curved (in the Alexandrov sense) polyhedral space (of dimension 3, say), $p,q\in P$ be vertices, and let $e$ be an edge connecting $p$ and $q$. Assume $e$ has cone angle $0&...
2
votes
1
answer
140
views
Tangent cone on polyhedral spaces
Let $X$ be an n-dimensional polyhedral space with, say, $n\geq 3.$ Let also $p\in X$ be a vertex on a triangulation $\tau$ of $X,$ so a vertex on the polyhedral space.
The tangent cone (as a metric ...
4
votes
2
answers
517
views
Secondary polytope
Given a polytope $P$, what do the points of the secondary polytope correspond to?
I know that the vertices of the secondary polytope correspond to regular triangulations of $P$.
But what do the ...
11
votes
0
answers
294
views
How many ways to flatten a Tesseract onto a table?
A cube can be cut and flattened out onto a table in a way that the faces stay connected and none of them overlap. There are $384$ ways to make the cuts and $11$ distinct meshes emerge (see here). And ...
2
votes
0
answers
48
views
Endpoints of intrinsic diameter of a convex polyhedron
Let $P$ be a convex polyhedron in $\mathbb{R}^3$, and $d(P)$ its intrinsic diameter,
i.e., the longest shortest surface path between two points. Say that $P$ is of
class
$D_0$ if neither endpoint of $...
0
votes
0
answers
86
views
Polynomial-time algorithm for exact projection to polyhedral cone
Given $c \in \mathbb{R}^d$ and $A \in \mathbb{R}^{n \times d}$, project $c$ to the polyhedral cone $\{x \in \mathbb{R}^d \mid A x \leq 0\}$. Is there an algorithm that outputs an exact solution to ...
4
votes
1
answer
137
views
On polyhedrons with specified numbers of congruent faces
Basic question: Given 3 integers n, n1 and n2 such that n1+n2 = n, to form an n-face polyhedron such that n1 of its faces are mutually congruent and the remaining n2 faces are different but congruent ...
2
votes
0
answers
228
views
Generalization of the Napoleon equilateral triangle to higher dimention
When I researched the Fermat-Dao-Nhi equilateral triangle in preamble before points X(33602) of the Kimberling triangle center. I discovered the general result for polygon as follows:
Let $A_1$, $A_2$...
0
votes
1
answer
191
views
Is $\pi_2 (X_i)$ a free $\mathbb{Z}\pi_1 (X_i)$-module for $i=1,2$?
Let $X_1$ be the suspension of $\mathbb{R}P^2$ and $X_2=\bigvee_{1\leq i\leq n} (\vee_{r_i} \mathbb{S}^i)$.
Is $\pi_2 (X_i)$ a projective (or a free) $\mathbb{Z}\pi_1 (X_i)$-module for $i=1,...
-4
votes
1
answer
134
views
Hilbert’s third problem and what a polyhedron is [closed]
What is the definition of a polyhedron used by Hilbert’s third problem?
11
votes
2
answers
1k
views
Which (semi)regular polyhedra are combinations of two others?
The convex combination of convex polytopes is a convex polytope.
An example in $\mathbb{R}^2$ is that a regular octagon
can be obtained as $\frac{1}{2} S + \frac{1}{2} S'$,
where $S$ is a square and $...
5
votes
1
answer
311
views
Are the polyhedral cones the only examples of cones that remains closed when they are added to vector subspaces?
Let $C \subset \mathbb{R}^{n}$ be a closed convex cone. If one wants to know whether the linear map $T:\mathbb{R}^{n} \to\mathbb{R}^m$ sends the closed set $C$ to another closed one, $T(C)$, it is ...
26
votes
7
answers
3k
views
What's that shape? Inferring a 3D shape from random shadows
Let $P$ be a bounded, simply connected region of $\mathbb{R}^3$.
$P$ could be a polyhedron, or a smooth shape, or an arbitrary shape;
I'll assume below that $P$ is a (non-degenerate, perhaps non-...
10
votes
2
answers
2k
views
Great polyhedra: What does "great" signify?
Great Cubicuboctahedron
Great Icosacronic Hexecontahedron
Great Rhombic Triacontahedron
Great Snub Icosidodecahedron
Great Stellated Dodecahedron
Great Triakis Octahedron
...
There are many polyhedra ...
7
votes
0
answers
210
views
Tiling space with supertile of hypercube unfoldings
Two students in my class
asked and answered what might be a novel question.
It is well known that the cube has exactly $11$ edge-unfoldings
(or "nets"), as shown below:
(Image from ...
20
votes
4
answers
906
views
The limit of edge-midpoint convex polyhedra
Starting with a convex polyhedron $P_1 \subset \mathbb{R}^3$,
replace that with $P_2$, the convex hull of the midpoints of the edges of $P_1$.
Continuing this process, we obtain a ...
26
votes
2
answers
4k
views
3D models of the unfoldings of the hypercube?
There are (apparently) 261 distinct unfoldings of the 4D hypercube, a.k.a., the
tesseract, into 3D.1
These unfoldings (or "nets") are analogous to the 11 unfoldings of
the 3D cube into the plane.2
...
0
votes
0
answers
93
views
Explicit equation for border of the Minkowski sum of sets
Assume we have sets of the form
$$
M_j = \{x\in\mathbb{R}^d : f_j(x) \le 0,x \ge 0\}
$$
where $x\ge 0$ means $x_i \ge 0 \quad \forall i=1,\dots, d$.
Goal
I am looking for an (explicit) representation ...
3
votes
1
answer
190
views
Well-behaved trajectories
Call trajectory any continuous function $f: \mathbb{R}_{\geq 0} \to \mathbb{R}^n$ (here, $\mathbb{R}_{\geq 0}$ is interpreted as time).
A polyhedral partition of $\mathbb{R}^n$ is a finite set of ...