Questions related to polyhedra and their properties.

learn more… | top users | synonyms

2
votes
0answers
65 views

Analytic-geometrical properties of dodecahedron

Consider the following projection of a dodecahedron: An equilateral triangle can be projected to make points $A, B, C, D, E, F$ intersect with it's edges. What would be the mathematical proof (if ...
0
votes
1answer
26 views

Something after after duals?

So if I have a polyhedron, x. Is it possible for a shape to be inscribed inside x (y). And inside y is z, but inside z is x. Is there a shape that could be x? If so what is it? Also, x, y, and z are ...
1
vote
1answer
18 views

Operations on polyhedra

Is there an operation on polyhedra that add $1$ vertex and $1$ facet (thus, due to Euler's formula, add two edges)? Here, a polyhedron is the convex hull of a finite number of non coplanar points in ...
4
votes
0answers
31 views

Computer realisation of automorphism group of polyhedron

I have a polyhedron (I am especially interested in the case of Platonic solids) and the graph corresponding to its skeleton. I also have some data associated with this graph (e.g. different ...
0
votes
0answers
35 views

Why is the component sum of a polymatroid analogous to size of a set and what is its relation to independence of a matroid?

I was learning about sub modularity and matroids in the following microsoft tutorial and they introduce the concept of polymatroid in parallel to matroids. In that talk they also introduce the concept ...
1
vote
1answer
20 views

Motions that Leave a Prism Invariant

Identify the group of all motions that leave a right prism invariant. It seems like the normal dihedral group, $D_n$, with respect to the base would be a subgroup of this group. That is to say that ...
3
votes
0answers
43 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 ...
1
vote
1answer
40 views

Labelling the Vertices of a Polyhedron

It is possible to label the vertices of a cube with strings of 3 binary digits in such a way that two vertices are adjacent if and only if the correspondent strings differ one from the other in ...
0
votes
0answers
33 views

Ball-of-wacks combinations

The six-color version of the ball-of-wacks consists of thirty rhomboidal pieces, which can be combined to form a rhombic triacontahedron. There are six colors, each with five pieces. One challenge ...
1
vote
0answers
23 views

Which convex polytopes do not have stellations?

Some polytopes, like the cube and the tetrahedron, do not have stellations (see http://mathworld.wolfram.com/Stellation.html). Has anyone characterized all convex polytopes (generally or in small ...
1
vote
1answer
67 views

“Octahedron” made from two pyramids of different heights.

I wonder how to name such shape: It's commonly used by e.g. 3ds max to visualize the bone in animation system. It consist of two pyramids with the exact same square base. It would be a ...
0
votes
0answers
35 views

Computing a lower bound for the minimal componentwise distance of vertices of polyhedra

Let $A$ be a matrix in $\mathbb{R}^{m \times n}$ and let $P = \{ x \in \mathbb{R}^n \mid Ax \leq b \}$ be a polytope. I want to compute a lower bound on the minimal componentwise distance of two ...
6
votes
2answers
622 views

Why can't a perpetual motion polyhedron exist?

I've been thinking about polyhedrons, when placed on a table on a certain face, will tip over and keep tipping over infinitely. I'm trying to prove mathematically that such a polyhedron doesn't exist. ...
0
votes
0answers
29 views

Distance from polyhedron to bounding ellipsoid

How can I find the distance from the edges of the polyhedron to the boundary of the ellipsoid? The ellipsoid is parameterized by: $$E = [ x : (x - x_c)^T H (x - x_c) \le m^2 ] $$ And it covers the ...
4
votes
1answer
59 views

Icosahedron and inscribed cube

We can inscribe a cube in dodecahedron (see this), where $12$ faces of dodecahedron give the $12$ edges of the cube. Can we inscribe cube in icosahedron?
1
vote
0answers
31 views

How to count the number of integer points in a polyhedral?

Let $k, l$ be positive integers and $k_1, l_1$ non-negative integers. I have a polyhedral give by the following inequalities: $$ A = \{(r_1,r_3,r_4,r_5): r_1+3r_4\leq l_1, -k_1 \leq r_5-r_3 \leq 0, ...
0
votes
0answers
9 views

How to write a polyhedra formula explicitly?

Let $m$ be a positive integer and $$ A_m = \{r=(r_1,r_2,r_3,r_4) \in \mathbb{Z}_{+}^4: r_4 \leq r_2, 2r_1+3r_2+3r_3 \leq m \}. $$ Let $$ch_m = \sum_{r \in A} ch((m-r_1-3r_2-3r_3)\omega_1 + (r_2 + r_3 ...
1
vote
0answers
181 views

Symmetries of Archimedean Solids

There are five platonic solids, and 13/15 (which is correct?) Archimedean Solids. The finite groups of isometries of Euclidean $3$-space are the finite subgroups of $SO(3,\mathbb{R})$ or ...
0
votes
1answer
27 views

Equality of polyhedra

Is a minimal representation for a polyhedron unique? And if so can we use this to prove that two polyhedra are equal (or maybe the same is a better definition).
0
votes
1answer
56 views

Is there any regular polyhedron that is not of Euler characteristic 2

Is there any regular polyhedron that 1. consist of congruent regular polygons as its faces 2. each vertex has same number of adjacent edges but nonetheless not of characteristic 2? (say, torus or ...
3
votes
2answers
177 views

Is Dodecahedron tesselation somehow possible?

In this video (at 3:25) there is an animation of planets inside a dodecahedron matrix (or any data-structure that best fit this 3d mosaic). I tried reproducing it with 12 sided dices, or in Blender, ...
1
vote
1answer
50 views

Proving the upper bound of edges in a convex polyhedron

The question is the following: Suppose Every face of a convex polyhedron has at least $5$ vertices and every vertex has degree $3$. Prove that if the number of vertices is $n$, then the number of ...
2
votes
1answer
201 views

Five Cubes in Dodecahedron

I will demonstrate why the group of rotational symmetries of a Dodecahedron is $A_5$. For that, we have to find five nice objects, on which the group of symmetries acts. One object is "Cubes" ...
1
vote
1answer
85 views

Is there a name for an irregular polyhedron of fourteen sides?

I was given a popup calendar that is cardboard and has 14 sides. The top and bottom are equilateral hexagons and each side of the top hexagon is attached to a trapezoid that widens away from the top ...
0
votes
0answers
72 views

The maximum pentahedron in a sphere

Suppose that there exists a pentahedron in a sphere whose radius is $1$ and that each vertex of the pentahedron can exist on the surface of the sphere. Question : What is the max of the volume of ...
1
vote
5answers
323 views

Relation between edgelengths in a tetrahedron with two right angles and three equal edges

I have got a problem I can't solve myself. I had an attempt, but it's wrong. I was told to draw a grid of this tetrahedron and then it's easier to find a solution (I tried it, but I don't see ...
2
votes
1answer
71 views

On the Formula: $V-E+F=2$

I am looking back at the history of the formula "$V-E+F=2$" for any polyhedron in Euclidean 3-space ($V=$number of vertices; $E=$ number of edges, $F=$ number of faces). Cauchy gave following proof of ...
1
vote
1answer
26 views

P - bounded polyhedron, L - linear map. Show that L(P) is a bounded polyhedron

Let $P = \{x\in \mathbb{R}^n \ | \ Ax\leq b\}$ be a bounded polyhedron. Let $L:\mathbb{R}^n \rightarrow \mathbb{R}^k$ be a linear map. Show that $L(P):=\{L(x)\ | \ x\in P\}$ is a bounded polyhedron. ...
5
votes
0answers
101 views

From Icosahedron to Pentagonal hexecontahedron (Floret Tessellation)

Inspired by this post: Floret Tessellation of a Sphere I tried to transform myself an icosahedron into its simplest Floret tessellation. But I am having trouble when applying the 'method' given in the ...
0
votes
0answers
15 views

Which functions preserve convexity of the cells of a polyhedral tessellation of $\mathbb{R}^n$?

Let $\mathcal{X}_1, \ldots, \mathcal{X}_m \subseteq \mathbb{R}^n$ be disjoint sets with $\bigcup_{i=1}^m \mathcal{X}_i = \mathbb{R}^n$. Furthermore, let each $\mathcal{X}_i$, $i = 1, \ldots, m$, be an ...
1
vote
5answers
173 views

Deriving Euler's Polyhedron Equation for middle school/high school students

I've been perusing the 20 proofs, but they all seem to involve graph theory and complexities... How would you derive this simple formula for high school or middle school students? Specifically: ...
1
vote
1answer
58 views

What is a good simple definition or characterization of 'polyhedral space'?

I would like to give a definition of polyhedral space in $\mathbb{R}^n$ that is easy to understand by people that has some Maths knowledge but are neither expert in Calculus nor any other Mathematics ...
9
votes
4answers
179 views

How many $A_5$ are there inside $A_6$?

I am reading a paper that says: There are $12$ versions of $A_5$ in $A_6$: $1) $ the permutations that leave one thing unmoved. $2)$ the permutations of the six pairs of antipodal ...
8
votes
2answers
621 views

Is the Euler characteristc defined wrong? If not, why not?

Ever since learning that $$\chi(S_0\# S_1) = \chi(S_0)+\chi(S_1)-2$$ (where $\chi$ denote the Euler characteristic), I've wondered whether $\chi$ isn't "defined wrong." If we let $\chi' = 2-\chi,$ ...
1
vote
4answers
502 views

How many faces does the resulting polyhedron have?

Take a regular tetrahedron of edge one. Also take a square-based pyramid, whose edges are all one (therefore the side faces are equilateral triangles of same size as the faces of the tetrahedron). ...
1
vote
0answers
46 views

Determining the set of a linear transformation of elements in a polyhedron

I have a set defined by linear inequalities of the form: $X = \{x : Ax \le b\}$. For any $x \in X$, I write $y = Gx$ where $G$ is a matrix (the dimension of $y$ is less than the dimension of $x$). ...
0
votes
2answers
38 views

Prove that a convex $d$-polytope has at least $d+1$ facets

This seems trivial but I can't come up with a formal proof. I think there should be a way to do this inductively but I can't figure out how$\ldots$ Any help much appreciated
1
vote
2answers
94 views

Why does induction procedure of Euler characteristic fail for non-convex polyhedra? What am I missing?

Euler characteristic of convex polyhedra is always $V-E+F=2$. Induction procedure reduces edges and vertices until we are down to one vertex whose $V-E+F=2$ and hence you are done. The same ...
0
votes
1answer
60 views

Proof: Minkowski sum polytope implies A and B polytopes

Suppose $A$ and $B$ are convex sets and their Minkowski sum $A+B$ is a polytope. How do you prove that $A$ and $B$ are polytopes as well?
0
votes
0answers
21 views

Maximization over linear surjective mapping of polyhedron

I am reading this paper and confused about the derivation of equation (11) (page 3, bottom of column 2). I will rephrase it in this question. Let $\mathcal{P}_r = \{ x \in \mathbb{R}^n : P_r x \leq ...
3
votes
1answer
36 views

Have face-transitive polyhedra been completely classified?

I've been researching polyhedral dice, and everywhere I look it states that face-transitive (and therefore fair) dice include polyhedra of various families, like the platonic solids, catalan solids, ...
11
votes
1answer
298 views

Largest $n$-vertex polyhedron that fits into a unit sphere

In two dimensions, it is not hard to see that the $n$-vertex polygon of maximum area that fits into a unit circle is the regular $n$-gon whose vertices lie on the circle: For any other vertex ...
2
votes
0answers
24 views

Does every polyhedral graph have a path cover with non-empty paths?

I'm looking to prove or disprove the following conjecture: Every polyhedral graph has a path cover with vertex disjoint, non-zero (length $\ge 1$) paths. Any pointers to literature are appreciated. ...
2
votes
0answers
44 views

On the Name of the Amplituhedron

Shouldn't the 'amplituhedron' really be called an 'amplitutope' since it's really a polytope and not strictly a polyhedron?
0
votes
2answers
80 views

Configuration of five or more mutually equidistant points in space.

How is it proved that there is no configuration of five or more mutually equidistant points in $R^3$? Is it done by induction? I'm stuck. Help would be appreciated. Well, surely equilateral ...
2
votes
1answer
113 views

Minkowski sum of two polytopes via the halfspace representation

If i have two polytopes denoted by $P_1, P_2 \subset \mathbb{R}^d$, suppose their halfspace representations are respectively $H_1x \leq K_1$ and $H_2x \leq K_2$. Now, considering their Minkowski sum, ...
1
vote
0answers
31 views

Folding a Given Net into a Polyhedron Automatically!

There are some applications to fold predefined nets into the polyhedra, e.g. "Poly" or this applet. Is there any application which automatically folds any net generated by the user, if possible?
1
vote
1answer
37 views

Find volume of parallelepiped where all faces are rhombuses with edge $a$ and angle $60^\circ$.

Find volume of parallelepiped where all faces are rhombuses with edge $a$ and angle $60^\circ$. I first noticed that $\dfrac{h}a=\sin60^\circ$, so I easly found that height of the rhombus is ...
2
votes
0answers
31 views

Create Platonic solids from the coxeter group (vertexes & edges & faces)

How can one define vertexes, edges and faces from the Coxeter group? For example, for all platonic solids? I would like to create a general function that takes the Coxeter diagram as input, and gives ...
2
votes
0answers
37 views

Discrete Analogue of the Poincaré Conjecture and Simple Connectedness

I apologize if this question is badly worded or obvious, but I have no formal topology background. I have put some effort into trying to find something, but nothing turned up, perhaps due to my lack ...