Questions related to polyhedra and their properties.

learn more… | top users | synonyms

1
vote
1answer
14 views

Finding a convex decomposition of a point in a polytope

Suppose I'm given the set of vertices, $\{v_i \} $, of a convex polytope. Suppose that I'm also given a point $p$ in terms of its coordinates, and I'm promised that $p \in \mbox{conv} \{v_i \}$. How ...
0
votes
0answers
12 views

Polyhedron, understanding face vs facet.

I've the two following definitions, for which I was trying to understand the difference. For a given polyhedron $P$ a face $F$ is both $P$ itself or the intersection of $F$ with $P$. A facet is ...
2
votes
1answer
38 views

Understanding definition of “dimension” of a subset of $\mathbb{R}^n$

In a book of combinatorial optimization the following definition is stated: A polyhedron in $\mathbb{R}^n$ is a set of type $P = \left\{x \in \mathbb{R}^n \;:\; Ax \leq b \right\}$ for some matrix ...
1
vote
1answer
167 views

Question about Euler's polyhedral formula in a proof of minimum distances

I am confused by a step made in a proof of the following result. Let $f_{2}^{\text{min}}(n)$ denote the maximum number of times the minimum distance can occur among n points in the plane. Then $f_{...
6
votes
0answers
80 views

What shape is the Sage logo

Just curious what is this shape used by Sage as its logo?
1
vote
0answers
70 views

Maximal unit lengths in 3D with $n$ points.

Given $n$ points in 3D space (V), what is the maximal number of unit distance lengths (E) between those points? Here are a few possibilities. Some of them are chromatic spindles. ...
2
votes
2answers
57 views

Counting faces of each type in a rhombicosidodecahedron

If I know that, in a rhombicosidodecahedron, at every vertex one triangle, one pentagon, and two squares meet, then how can I compute the number of faces and edges that are needed to build it? There ...
0
votes
0answers
29 views

Properties of polyhedron solving constrained max problem

This is a question for people who don't have trouble to think in more than two dimensions. Don't hesitate to ask clarifying questions! Let us suppose we have $n$ random variables $X_i$ that are iid ...
0
votes
1answer
30 views

Which vertex-transitive planar graphs represent non-self-intersecting polyhedra?

Consider an infinite planar graph with the following properties. Its vertices all have valence $3$. The faces all have $5$ edges. Now put it in cartesian space and require that the faces are all ...
1
vote
0answers
17 views

Which rhombuses can make a rhombic dodecahedron

There are two dodecahedra I know of whose faces are identical rhombuses. One has rhombuses whose diagonals have a ratio of $\sqrt{2}$ -- this one is often simply called the "rhombic dodecahedron". The ...
1
vote
0answers
8 views

Finding a polytope in the Cartan Subalgebra

The finite Coxeter groups can be realized as symmetry groups of (semi)-regular polytopes. Not all semi-regular polytopes can be realized this way, but all regular polytopes can. Some examples of ...
0
votes
2answers
33 views

Polyhedron with 12 pentagons and 1 hexagon

In this answer http://mathoverflow.net/a/19823/5239, it is indicated that it is impossible to make a polyhedron (with 3 faces meeting at each vertex) out of 12 pentagons and 1 hexagon. There is ...
1
vote
0answers
5 views

Complementary Facets of Pointed Cone

I am looking at a particular full-dimensional pointed cone $C \subset R^{11}$ with $14$ generators. In matrix form, with each column being a generator, I have the matrix \begin{pmatrix} 1 & 1 &...
8
votes
1answer
88 views

can a convex polygon have only one boundary point at locally maximum distance from its centroid?

It's easy to see that given any convex polygon P and any point c in its interior, there is at least one point m on the boundary of P at locally maximum distance from c: simply choose m to be a vertex ...
2
votes
1answer
40 views

How to prove a set of inequalties in not satisfiable?

For the set of inequalities $$\begin{cases} 10 a - b - c \ge d\\ 5 b - a - c \ge d\\ 2 c - a - b \ge d\\ d \ge a + b + c\end{cases}$$ how can I show these cannot all be satisfied for $a, b, c, d$ ...
8
votes
4answers
5k views

Angle between lines joining tetrahedron center to vertices

What are the angles formed at the center of a tetrahedron if you draw lines to the vertices? I'm trying to make these: I need to know what angles to bend the metal.
2
votes
1answer
28 views

Existence of direction for polyhedral set

I refer to Lemma 4.42 of this lecture notes on linear programming, about the relationship between the boundedness of a polyhedral set and its directions. Let $P$ be a non-empty polyhedral set. ...
1
vote
0answers
63 views

Twisty Puzzle Solving Program

I'm writing a program to help me solve a twisty puzzle. In this case it's the face-turning octahedron. I'm representing the puzzle as a group with face twists as generators. The facelets are in a list ...
4
votes
1answer
43 views

Computing volume of concave polyhedron

I have a circular grid with points uniformly distributed throughout it. See this: Each point has some nonnegative height assigned to it (i.e. height can be 0 on up). I'm trying to accurately ...
1
vote
0answers
39 views

What are the exact angles of the triangular faces of each of the rhombic pyramids of the icosahedron stellation, the compound of five octahedra?

I'm talking about this compound of five regular octahedra. Based on looking at the icosahedron stellation diagram and making an educated guess about where the golden ratio comes in, I calculated the ...
0
votes
0answers
10 views

constrain general solution of ill-posed linear system to $\Re_+$?

I have a solution space of an under-determined linear system Ax = b with n x m matrix A: $$x= x0 + V2 * c (1)$$ with [U, S, V] = svd(A); V2 = V(:,r+1:end); $x0 = A^+ b; $ r = rank(A); I ...
0
votes
0answers
11 views

maximal volume/diameter of a set of simplexes

I am trying to develop a simplicial integral in $R^n$ and I am faced with the problem of controlling the "compacity" of a set of simplexes: Let $S$ be a finite set of n-d simplexes in $R^n$. Define ...
2
votes
1answer
41 views

maximal volume/diameter of polyhedron

I am trying to develop an integral in $R^n$ and I am faced with the following problem: Given a polyhedron $P$ in $R^n$ of diameter d, define the "compactness" of $P$ as the quotient of the volume of $...
1
vote
1answer
27 views

Dual of the Minkowski Sum

Suppose $X$ and $Y$ are convex sets in $\mathbb{R}^d$ such that the origin is in each of their interiors. Then the dual of $X$, $X'$ is defined as the set of linear functionals $\alpha$ such that $\...
4
votes
2answers
2k views

What are the vertices of a regular tetrahedron embeded in a sphere of radius R

Imagine you had a sphere of radius R centered at the origin. What are the coordinates of the vertices of the regular tetrahedron which is circumscribed by the sphere? One of the vertices of the ...
2
votes
0answers
16 views

Does it make sense to compare sets (polygons) with different dimensions?

In the context of integer programming, I am considering 3 different linear models for a given problem. The goal is to determine which formulation is the tightest, that is, the one that gives the least ...
0
votes
0answers
20 views

$\{x\in R^n | Ax \leq b\} \cap \{x \in R^n | Dx \leq d\}= \emptyset$ iff there is a vector $c \in R^n$ such that $c^Tx < c^T y$

Consider two non-empty polyhedra $P := \{x\in R^n | Ax \leq b\}$ and $Q := \{x \in R^n | Dx \leq d\}$. Show that $P \cap Q = \emptyset$ if and only if there is a vector $c \in R^n$ such that $c^Tx <...
1
vote
2answers
149 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 ...
1
vote
2answers
34 views

Construct a homemorphism $\phi : T^2/A \rightarrow X/B $

Construct a homemorphism $\phi : T^2/A \rightarrow X/B $ $T^2=S^1 \times S^1$ and $A \subset T^2$ is given by $A=S^1 \times\{1\}$. $X=S^1 \times [-1, 1]$ and $B = S^1 \times\{-1, 1\}$. $T^2/A$ ...
1
vote
1answer
70 views

What is the depth of water above the prism?

I have been practising for a math competition and came across the following question: A fishtank with base $100\,\rm cm$by $200\,\rm cm$ and depth $100\,\rm cm$ contains water to a depth of $...
1
vote
2answers
31 views

Is a convex cone a convex polyhedron?

Say that I have a convex cone $C=\{t|Ax = t, x\geq 0\}$. where $x\in R^n$, and $t\in R^m$, $A\in R^m\times R^n$. Can I say that this is a convex polyhedron? and why? EDIT: Just in order to avoid ...
5
votes
1answer
205 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
2answers
42 views

Polygon with curved sides, and higher-dimensional generalizations

I am trying to find references about generalizations of polygons with non-straight sides. I am interested in both the convex and non-convex cases, and particularly in polynomial boundaries, and ...
1
vote
0answers
14 views

Regular packing of an infinite number of infinitely long cylinders in 3d space

Is it possible to pack an infinite number of congruent infinitely long cylinders into 3 dimensional space in a regular pattern? Another condition is that an equal number of the cylinders must be ...
-5
votes
1answer
75 views

Which Archimedean solid takes up the most volume in its circumscribed sphere? [closed]

I have a question that has really kept me wondering: Which Archimedean solid takes up the most volume in its circumscribed sphere?, meaning Which solid takes up the greatest percentage in its ...
0
votes
1answer
38 views

Find the edge angle of a dodecahedron using spherical trigonometry?

How can I find the edge angle (the angle at the center of a polyhedron subtended by an edge of the polyhedron) of a dodecahedron (a polyhedron with 3 pentagonal faces meeting at each vertex)? I know ...
3
votes
1answer
69 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 ...
4
votes
1answer
93 views

Lower bound on the number of faces of a polyhedron of genus g

Is there a lower bound on the number of faces of a polyhedron of topological genus g? For example: it seems very reasonable that $g$ < $F$ i.e. the genus of a polehydron is less than the number ...
3
votes
0answers
33 views

Asymptotic bounds on the number of faces needed to construct a polyhedron of a certain genus

Let a polyhedron be a solid in three dimensions with flat polygonal faces, straight edges and sharp corners or vertices, where moreover we require that every edge touches exactly two faces, every ...
1
vote
0answers
31 views

Simplest molecules with multiple local minima

Methane (C + 4 H) goes to a tetrahedral structure. Water (O + 2 H + 2 e-) goes to a slightly skewed tetrahedron. In a computer model, both of these have no local minimum problems. There is a ...
5
votes
0answers
31 views

Single loop polyhedra

The odd antiprisms are both Eulerian and polyhedral, with the first implying that the edge can be represented with a single closed path. The Cuboctahedron also has that property. With the rule to ...
2
votes
0answers
26 views

How to construct a polyhedron from given planes

This seems to be a basic questions, but I really don't know a good computer algorithm to do this. I have a set of planes (parameterized by normal direction and distance from a given point), and I want ...
0
votes
0answers
10 views

Estimate size of smallest solution to linear program

I have a linear program: a system of linear inequalities of the form $$Ax \le b, \qquad x \ge 0.$$ where $x \in \mathbb{R}^n$, $b \in \mathbb{R}^m$, and $A$ is a $m\times n$ matrix. I am looking ...
0
votes
0answers
22 views

Formal definition of a face of a polyhedron

Given an $n$-dimensional convex polyhedron, an $(n-1)$-dimensional face of it can be defined as an intersection of the polyhedron with a supporting hyperplane. What is the formal definition in the ...
0
votes
3answers
242 views

Relationship between angles in tetrahedron

Let's say I have a tetrahedron like this in image: Are the angles $\angle CAD$ and $\angle CBD$ equal in a general tetrahedron?
0
votes
0answers
17 views

Number of Edges in Unimodular Triangulation of Simplex

Let $d\Delta$ be the simplex that's the convex hull of $(0, 0, 0, 0), (d, 0, 0, 0), (0, d, 0, 0), (0, 0, d, 0), (0, 0, 0, d)$. A unimodular triangulation of $d\Delta$ is a subdivision of it into ...
0
votes
0answers
72 views

Difference between invariant and contractive sets

I came across this particular notion of contractive sets. I know what an invariant set is, but can anyone explain what a contractive set is and the difference between invariant and contractive sets?
2
votes
0answers
17 views

Tracing the faces of a convex polyhedron from edges and vertices

I have a set of vertices and edges that by construction, form a convex polyhedron. I would like to know how to trace out the faces of such a polyhedron i.e. find a list comprised of set of edges that ...
2
votes
0answers
56 views

Number of deltahedra as a function of the number of faces

How does the number of deltahedra (polyhedra with only equilateral triangles as faces) with no holes grow asymptotically as a function of the number of it's faces? If we have this as $N=g(F)$ for ...
3
votes
0answers
108 views

Polyhedra with identical faces

The isohedra have identical faces. They have symmetries acting transitively on their faces -- any face can be mapped to any other face to give the same figure. There are also polyhedra where all ...