Questions tagged [polyhedra]
The polyhedra tag has no usage guidance.
219
questions
2
votes
1
answer
89
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 ...
1
vote
0
answers
53
views
Are there polyhedra $P_1$ and $P_2$ such that $N\cong \pi_1 (P_1)$ and $G/N\cong \pi_1 (P_2)$?
Let $G\cong \pi_1 (P)$ where $P$ is a polyhedron with finitely generated homology groups $H_i (\tilde{P};\mathbb{Z})$ for $i\geq 2$. Let $N\leqslant G$ be a normal subgroup. Are there polyhedra $P_1$ ...
10
votes
2
answers
1k
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
148
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 ...
0
votes
0
answers
43
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 ...
1
vote
0
answers
32
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 ...
3
votes
1
answer
180
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 ...
9
votes
2
answers
378
views
Are there Monohedra with odd number 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 polyhedrons that includes the Platonic solids ...
5
votes
2
answers
277
views
Dimension of configuration space of triangulated convex polyhedron
The configuration space of all tetrahedra is $5$-dimensional, perhaps a non-obvious fact.
There are $12$ face angles, but the sum of each of the four faces angles is $\pi$,
reducing $12$ to $8$ ...
0
votes
1
answer
91
views
The dimension of the normal cone of a face in a polytope
Let $P$ is a polytope in $\mathbb{R}^n$ if $F$ is one of its faces of dimension $d$ then the dimension of its normal cone $\mathcal{N}(F)$ is $n-d$.\
This seems to be intuitively obvious but I can't ...
2
votes
0
answers
78
views
Dodecahedron deformation II
(Follow-up to this question)
Can a dodecahedron be deformed into a great stellated dodecahedron while maintaining the number of dimensions each element occupies?
6
votes
1
answer
227
views
Can a dodecahedron be deformed into a great stellated dodecahedron?
Can a convex regular dodecahedron be deformed into a great stellated dodecahedron while keeping all pentagons planar and all edges of nonzero length the whole time?
3
votes
1
answer
317
views
Request for an article by Jim Lawrence
Jim Lawrence has a very important paper on the topic of valuations on polyhedra called "Rational-function-valued valuations on polyhedra", published in the DIMACS volume Discrete and ...
5
votes
1
answer
189
views
Convex polyhedra with non-congruent faces
Question: Are there convex polyhedra wherein all faces are convex polygons with same area and perimeter and no two faces are mutually congruent?
Remarks: If the answer to above is "no", then,...
14
votes
2
answers
988
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 ...
25
votes
1
answer
1k
views
Which unfoldings of the $d$-dimensional hypercube tile $(d{-}1)$-space?
A six year old question,
Which unfoldings of the hypercube tile $3$-space?, has just been answered by
Moritz Firsching:
All $261$ unfoldings tile space!
So now we know:
For $d=2$, the unfolding of ...
1
vote
0
answers
46
views
Regularity of Laplace equation on non-convex polyhedral domain
This might be a known problem, but I could not find a precise answer.
I have the following Laplace equation
\begin{equation}
\begin{cases}
-\Delta u = f & x \in \Omega;\\
\quad\: u = g & x \in ...
3
votes
0
answers
103
views
"Slim" directed polytopes: any established name for them?
This is a "looking for context" question.
Let's say that a polytope is directed if its 1-skeleton is an oriented graph with no cycles, one source, one sink. (Edit: let us additionally assume ...
2
votes
0
answers
71
views
Polyhedron coordinate bound
Given a polyhedron
$$Ax\leq b$$
where we assume $A\in\mathbb Q^{m\times n}$ and $b\in\mathbb Q^{m}$ and it takes $L$ bits to represent the inequalities what is a good bound on the quantity $\|y\|_\...
1
vote
0
answers
62
views
Counting $\bmod 2$ number of vertices of sparsely represented polyhedra
Given a polyhedron
$$Ax\geq b$$
is there an $NC^1$ or an $NC^2$ algorithm to count the number of vertices $\bmod2$?
Assume $A\in\{0,1\}^{m\times n}$ and $b\in\mathbb Z^{m}$ ($m=O(n)$) and assume rows ...
1
vote
0
answers
42
views
Detecting non-negativity of a single constraint by polyhedral constraints - $II$
Let $$\langle a,x\rangle=b$$ be a linear constraint where $x\in\mathbb R^n$ and every entry in $a=(a_1,\dots,a_n)$ is in $\mathbb Z_{\geq0}^{n}$ (non-negative) and the entry $b$ is in $\mathbb Z_{\...
0
votes
1
answer
97
views
Detecting non-negativity of a single constraint by polyhedral constraints - $I$
We consider $$\langle a,x\rangle=b$$ (linear constraints) where $x\in\mathbb R_{\geq0}^n$ and every entry in $a=(a_1,\dots,a_n)$ is in $\mathbb Z_{\geq0}^{n}$ (non-negative) and the entry $b$ is in $\...
1
vote
0
answers
107
views
Integrality of polyhedra
Given two polyhedra in $H$ representation $P_1:Ax\leq b$ and $P_2:Bx\leq c$ which are integral are bounded when is their intersection also integral?
Given two polyhedra in $H$ representation $P_1:Ax\...
0
votes
0
answers
80
views
Number of vertices in a polyhedron
Consider polytopes
$$A_1[x_{1,1},\dots,x_{1,m_1},z_{1}]'\leq b_1$$
$$A_2[x_{2,1},\dots,x_{2,m_2},z_{2}]'\leq b_2$$
$$B[z_{1},z_{2},z]'\leq c$$
having vertex count $v_1,v_2$ and $v$ respectively.
We ...
1
vote
1
answer
117
views
Exactly counting number of vertices of a polyhedron
Suppose $Ax\leq b$ is a polyhedron, where the number of rows in $A$ is $r$, the vector $x$ lies in $\mathbb R^n$ and the rank of $A$ is $t$. Assume minimal number of hyperplane inequalities to define ...
0
votes
1
answer
92
views
Number of linear inequalities describing a polyhedron with prescribed number of vertices
If a polytope has $d$ vertices in $k$ dimensions how many linear inequalities is required to describe it?
5
votes
1
answer
241
views
Embedding an icosahedron
A transitive set in $\mathbf{R}^n$ is a finite set with a transitive group of symmetries. I want to understand how subsets of a transitive set constrain the group.
Let me start with the example of a ...
2
votes
0
answers
110
views
Distinguishable knots (with constraints) over polyhedra
I'm trying to find the number of distinguishable knot projections over certain convex regular polyhedra according to the following constraints. On each face on the polyhedron the knot will have a ...
4
votes
1
answer
131
views
Finding Motzkin's original paper on copositive quadratic forms
I am currently in the process of writing my thesis about copositive matrices and would like to write a chronological narrative about the ascent of these matrices to the prominent place they have today ...
1
vote
0
answers
50
views
Classification of pseudoregular polyhedra
In contrast to a regular polyhedron, which has one orbit of flags, I’ve been studying what I call pseudoregular polyhedra, which have two orbits of flags interchanged by conjugation (explained here). ...
1
vote
0
answers
121
views
Decomposition of Polyhedral - An example
There is no doubt that clear examples consolidate the understanding of concepts being learnt. I am new to finding the structure and decomposition of a polyhedra. Suppose that we have the system
$$ \...
4
votes
1
answer
85
views
Is the space of Euclidean polyhedra with a fixed $1$-skeleton connected?
Let $\mathcal{A}_\Gamma$ be the space of convex (non-degenerate) Euclidean polyhedra with $1$-skeleton a certain polyhedral graph $\Gamma$. This space can be seen as a subset of $\mathcal{Gr}_2(\...
3
votes
1
answer
162
views
Duality argument for elliptic regularity
M. Dauge proved in [1] the regularity property "$\Delta u \in (W^1_{p'})^*$ $\Rightarrow$ $u \in W^1_p$" for Dirichlet and Neumann problem in domains with piecewise smooth boundaries, for $p&...
8
votes
1
answer
214
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(\...
5
votes
0
answers
135
views
What is the expected value of the volume of a tetrahedron inscribed in the unit sphere?
Four (non-coincident) points on the unit sphere determine a tetrahedron. What is the expected value of the volume of such a tetrahedron--the volume of the sphere itself being $\frac{4 \pi}{3} \approx ...
4
votes
2
answers
179
views
Clustering of vertices in an $n$-dimensional cube
Consider the vertices of an $n$-dimensional cube. The distance between two vertices is measured as the minimum number of edges between the two vertices. Now consider a subset of these vertices.
If we ...
8
votes
1
answer
849
views
Two questions on the permutohedron
The $n$-dimensional permutohedron $P_n$ is the polytope given by the convex hull of all the possible permutations of the vector $(1,2,\dots,n+1)\in\mathbb{R}^{n+1}$. So it has $(n+1)!$ vertexes.
I ...
10
votes
2
answers
336
views
Do Bernoulli polynomials know about face vectors?
This question is grounded firmly in numerology. It originates in an observation about some Bernoulli polynomials and the regular icosahedron. Let $F_{k+1}(n)=\sum_{i=1}^n i^k$ be the sum of the ...
14
votes
0
answers
302
views
Minimum number of distinct triangles for tesselating the sphere
Consider sequences of tesselations of the sphere. For instance, one such sequence might start with an icosahedron and proceed by subdividing each triangle face into 4 triangles and projecting the new ...
10
votes
0
answers
210
views
What are the known convex polyhedra with congruent faces?
Note: I originally asked this question on math.SE here, where I posted a bounty on the question but received no answers after a week despite apparent interest in the problem. I'm hoping MathOverflow ...
10
votes
0
answers
271
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 ...
6
votes
1
answer
151
views
Is Sydler's theorem concerning Dehn invariants constructive?
Sydler proved something of a converse to Dehn's negative resolution
of Hilbert's 3rd problem. To quote Wikipedia, Sydler showed that
"every two Euclidean polyhedra with the same volumes and Dehn ...
0
votes
0
answers
72
views
Find tetrahedron vertex given 3 vertices of a face and the 3 opposite angles
I have the following tetrahedron:
which I know the coordinates of $P$, $Q$ and $R$ and the value of angles $\theta_0$, $\theta_1$ and $\theta_2$.
I need to find the coordinates of vertex $E$. Is that ...
4
votes
0
answers
61
views
Classification of space-filling (by identical copies) convex polyhedra in R^3
Is the classification of space-filling (by identical copies) convex polyhedra in R^3 is known ?
There are only 5 "parallelohedra" - filling by translation.
But if relax that property to ...
2
votes
2
answers
99
views
How to define and compute the degree of congruence of two rigid polyhedra in same type with knowing vertex coordinates?
If I have two sets of points in 3-dimensional space, each sets of points are the coordinates of vertices of a polyhedron. The two polyhedra have same type, so we don't need to consider the topological ...
2
votes
1
answer
68
views
Do continuous motions of the vertices of convex polyhedra that maintain local convexity imply global convexity? (Reference request)
A convex polyhedron has all of its internal dihedral angles in $(0, \pi)$. However, if I start with an abstract polyhedron $P$, let's say a triangulated one, so I don't have to worry about planarity ...
3
votes
1
answer
60
views
Tilings of lattice polytopes by transformations of lattice polytopes
A quasi-lattice polytope is a polytope obtained by reflections, translations, and rotations of lattice polytopes. In a tiling of a lattice polytope by quasi-lattice polytopes, are all quasi-lattice ...
1
vote
0
answers
71
views
Untruncate permutohedron of order 5
I would like to understand commutation classes of reduced expressions of the longest element in $S_5$ a little better. For this, it makes sense to look at the permutohedron of order 5. Since I am only ...
0
votes
0
answers
58
views
Visualization of higher Bruhat order B(5,2)
I made the following images of the higher Bruhat order B(5,2) (in the sense of Manin/Schechtman) with vZome:
image 1
image 2
image 3
Unfortunately, in vZome its not possible do have regular octagons,...
3
votes
0
answers
103
views
Pyramids whose volume can be computed by simple cutting and glueing
Since this question remained without answers even after a bounty, I thought it might be time to ask it here.
For which pyramid can you compute the volume from simple cut-and-glue processes? The Dehn ...