Questions related to polyhedra and their properties.

learn more… | top users | synonyms

5
votes
0answers
88 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 ...
5
votes
0answers
63 views

Symbols to represent each distinct symmetry of polyhedra

Is there a pictorial or symbolic way to represent each distinct symmetry of a polyhedron?
5
votes
0answers
105 views

Is Paley-13 graph a unit distance graph in 3D space?

The 13-node Paley graph has vertices 1 to 13 that are connected by an edge when their difference is one of the values $(1,3,4,9,10,12)$ Can this graph be put into 3D space so that all edges have ...
4
votes
0answers
54 views

Isomorphism of divisors

Consider the cartier divisor group $CDiv_{T_{N}}(X_{\Sigma})$ defined on the fan $X_{\Sigma}$. I am having trouble proving the following assertion that there is a natural isomorphism ...
4
votes
0answers
30 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 ...
4
votes
0answers
68 views

Mappings preserving convex polyhedra

It is known that linear mappings between euclidean spaces map convex polyhedra to convex polyhedra. Can you give a characterization of the class of mappings that preserve convex polyhedra?
3
votes
0answers
40 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 ...
3
votes
0answers
43 views

Convex Polyhedron problem

I want to prove it isn't possible to make a football (a convex polyhedron such that at least 3 edges meet at each vertex) out of exactly 9 squares and m octagons where $m>3$.
3
votes
0answers
49 views

Regular apeirohedra?

Have been toying with structures that I think are best describe as unbounded regular polyhedra. More specifically I arrived at non-convex polyhedra that are unbounded in one direction: Alternate ...
3
votes
0answers
140 views

Represent numbers on clock by polyhedrons

The "1" is replaced with a four-sided object, then the next one could be a five sided object, then six (the cube), but then after that, it is either a five-sided pyramid, or a eight-sided die. ...
3
votes
0answers
157 views

3-manifold theorem reference request or proof

The following is a theorem of which I have great interest in but cannot find anything about on the internet, Every 3-manifold of finite volume comes from identifying sides of some polyhedron I'm ...
2
votes
0answers
9 views

Dinamically generate Goldberg polyhedra G(m,n)

In these pages the autor provided a lot of info about some Goldberg polyhedra (http://en.wikipedia.org/wiki/Goldberg_polyhedron): http://dmccooey.com/polyhedra/DualGeodesicIcosahedra.html ...
2
votes
0answers
53 views

What honeycomb has the highest volume to edge length ratio?

This question is analagous to the Kelvin Problem where the solution, the Weaire-Phelan Structure, has the highest volume to surface area ratio; however, the cell volume is compared to edge length ...
2
votes
0answers
33 views

What is the name of convex polyhedra with congruent faces of regular polygons?

The definition of platonic solids is the following (see Wikipedia): In Euclidean geometry, a Platonic solid is a regular, convex polyhedron with congruent faces of regular polygons and the same ...
2
votes
0answers
55 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 ...
2
votes
0answers
23 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
43 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?
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
35 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 ...
2
votes
0answers
153 views

Drawing a Truncated Octahedron

I'm trying to draw a truncated octahedron in MATLAB. This is also known as a permutahedron so my strategy is to link up all the vertices via adjacent transpositions of permutations in $S_4$. What I ...
2
votes
0answers
68 views

Number of faces of a polytopal subdivision

Let $\mathcal{P}$ be a (bounded) polytope in $\mathbb{R}^d$ and let $\mathcal{C}$ be a polytopal subdivision of $\mathcal{P}$ [1]. Is there a known tight upper bound in the number of polytopes in ...
2
votes
0answers
17 views

The process of alternation on an n-polytope

I am currently working on a problem involving algebraic geometry and as a part of the research it would be helpful for me to understand the process of alternation, also called partial truncation, ...
2
votes
0answers
23 views

The exact type of my 3d model

I have reconstructed vertical features (hole like objects lie on a vertical face) lie on two connected faces. To understand the situation, I say I have 2 walls with many windows and doors on ...
2
votes
0answers
44 views

Equation on the vertices of regular polyhedra

I found in this book, on page 6 that the equation on vertices of icosahedron inscribed in sphere considered as $\mathbb{CP}^1$ by means of stereographic projection is $xy(x^{10}+14x^5y^5-y^{10})=0$. ...
2
votes
0answers
171 views

categorical description of the Minkowski sum of polytopes

Consider the category $\textbf{Poly}$ of polytopes, where the objects are convex hulls of finite subsets of $\mathbb{R}^d$ for arbitrary $d \in \mathbb{N}$ and where the morphisms are affine maps ...
2
votes
0answers
50 views

How to fit a cuboid into a polyhedra?

I have multiple points which create a solid (polyhedra). And now I want to place a cuboid inside this solid in a way that it uses the maximum amout of space inside. Are there any solutions for this ...
2
votes
0answers
67 views

About the relation between a tetrahedra and spheres moving in a tetrahedra

I found the following question in a book: There exists a regular triangle $OAB$ which has edge-length $2$. Let $H, I, J$ be a foot of the perpendicular line drawn from a point $P$ in $OAB$ to the ...
2
votes
0answers
36 views

The dimension of birkoff polytope

Let $P_m$ be a subset for R^mxm be the polytope given by: $x_i,_j \ge 0$ $x_i,_1 + ... + x_i,_m \le 1$ $x_1,_j + ... + x_m,_j \le 1$ $\sum_{1 \le i,j \le m } \ x_i,_j \ge m-1$ Contruct a ...
2
votes
0answers
52 views

Convex cone as sum of simplices?

In 3D a pyramid with a square base can be decomposed into the sum of two tetrahedra, i.e. two 3-simplices. I am dealing with a homogeneous N-dimensional system of inequalities and my solution is a ...
2
votes
0answers
187 views

$\{x:Ax\leq 0\}$ contains a subset of type $\{x:A'x=0, ax\leq 0\}$

If $C:=\{x:Ax\leq 0\}\neq\{x:Ax=0\}$, an independent set of rows of $A$ can be chosen, one denoted by $a$ and the others put as rows into a matrix $A'$, such that $\{x:A'x=0,ax\leq 0\}\subseteq C$. ...
2
votes
0answers
72 views

Are there 3D tilings of a 3D projective hyperplane or 3-sphere?

I noticed that pentagons tile the projective plane (a spherical dodecahedron). Something they do not do on a flat euclidean plane. Is there analogous 3D tilings (honeycombs) of a 3D projective ...
2
votes
0answers
49 views

Geometric Interpretation of $h_1(P)=f_{d-1}(P)-d$ for a polytope

In our lecture "Discrete Geometry 1", we are examining lineare realtions between the components of the f-vector and the h-vector of a polytope, in particular the Euler-Poincaré formula and the ...
2
votes
0answers
76 views

Integration over a polyhedron

We face the problem of computing the integral of a function f over a polyhedron P (defined by a mixed integer linear program) and we were thinking of using Latte (link) for this task. We would like to ...
2
votes
0answers
189 views

The structure theorem of Tropical geometry

The Structure Theorem of Tropical geometry states that "Let $X$ be an irreducible $d$-dimensional subvariety of $\mathbb T^n$ . Then $\operatorname{trop}(X)$ is the support of a balanced weighted ...
1
vote
0answers
10 views

How to determine the outward normal vector of a face of a hexahedron if the orientation (CW or CCW) of vertices of the face is unknown

Consider a single quadrilaterally-faced hexahedron. If given the co-ordinates of the vertices, $\mathbf{v}_i$, of a face in counter-clockwise orientation, I can compute the corresponding unit outward ...
1
vote
0answers
80 views

The skeleton of Eulerian polyhedra

There is (at least) two kind of validity domain of Euler's $v−e+f=2$ polyhedron formula. One is the "Eulerian" polyhedra, i.e. simply connected polyhedra with simply connected faces (see here). The ...
1
vote
0answers
43 views

How to find out the circumscribed radius of a snub dodecahedron?

A snub dodecahedron is produced by partially rotating all 12 regular pentagonal faces of a small rhombocosidodecahedron. A snub dodecahedron has 80 congruent equilateral triangular faces, 12 congruent ...
1
vote
0answers
22 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
0answers
30 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, ...
1
vote
0answers
179 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 ...
1
vote
0answers
44 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$). ...
1
vote
0answers
29 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
0answers
87 views

Linear programming - Textbook recommendations

Next term, I will attend a course on linear programming. Due to the assignments, we will have to write many thorough proofs. I anticipate that we will be supposed to cope with in-depth background ...
1
vote
0answers
64 views

Proof that a Polytope has vertices

As part of my Discrete Optimization course, I have a homework where I have to prove that a Polytope has vertices. I seems to have all tools in hand (definition of a vertex, polytop, convex hull, etc.) ...
1
vote
0answers
45 views

Generalized permutahedron and random polytopes

The Birkhoff polytope $B_n$ is defined as the convex hull of the set of permutation matrices, which gives us the set of doubly stochastic matrices. A concept which is intimately related is that of the ...
1
vote
0answers
46 views

showing that all convex polehedron graphs are 3-connected

I'm trying to figure out how to show that two nonadjacent vertices in the graph of a convex polyhedron can be disconnected from one another by the removal of at least three vertices. I know what a ...
1
vote
0answers
75 views

Stereographic projection of the icosahedron and snub cube?

Using a steoreographic projection, the three equations associated with the icosahedron with unit circumradius, inradius, and midradius (respectively) are, $$f=z^{20} - 228z^{15} + 494z^{10} + 228z^5 ...
1
vote
0answers
80 views

Dodecahedron: How do we get the distance between 2 opposite faces?

I am deciphering a CSS code that Ana Tudor Maria has done. http://codepen.io/thebabydino/pen/qIfbL In her example, she has a formula that calculates the distance between 2 opposite faces. I have no ...
1
vote
0answers
62 views

Net for both cube and regular tetrahedron

At how to fold it by Joseph O'Rourke, there is a net given that can be folded into a cube or irregular tetrahedron. Is there a net that can be folded into either a cube or regular tetrahedron?
1
vote
0answers
112 views

Indexing Goldberg (0,n) polyhedron faces

I would to know how to uniquely identify a face of a Goldberg (0,n) polyhedron: http://en.wikipedia.org/wiki/Goldberg_polyhedron#Icosahedral_G.280.2Cn.29_polyhedra It's possible to uniquely assign ...