# Questions tagged [polyhedra]

The tag has no usage guidance.

201 questions
Filter by
Sorted by
Tagged with
0answers
36 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 ...
1answer
80 views

0answers
64 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 ...
1answer
110 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 ...
1answer
80 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?
1answer
211 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 ...
0answers
95 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 ...
1answer
114 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 ...
0answers
43 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). ...
0answers
51 views

0answers
202 views

### Complexity of scissors congruence?

Where is the complexity of the problem 'Given two bounded compact convex integral polyhedra in $\mathbb R^n$ presented by $O(poly(n))$ integer valued halfspaces given by linear inequalities with ...
2answers
95 views

### Products of polytopes and the normals of their facets

I need to compute the normals of the facets of certain polytopes that can be represented as products of polytopes in smaller dimensions. Searching the bibliography I found that the facets of the ...
3answers
528 views

### Alexandrov's generalization of Cauchy's rigidity theorem

Wikipedia states that A. D. Alexandrov generalized Cauchy's rigidity theorem for polyhedra to higher dimensions. The relevant statement in the article is not linked to any source. The sources at the ...
0answers
181 views

### Motivic strong bellows conjecture

There is a theorem due to Gaifullin--Ignashchenko stating that the Dehn invariant of any flexible polyhedron in the $n$-dimensional Euclidean space ($n\geq 3$) is constant during the flexion. Is ...
0answers
28 views

### When do projection maps of polyhedra factor?

Given three polyhedra $P$, $Q$, and $R$ in dimensions $a$, $b$, and $c$ respectively, with $a\leq b\leq c$, with the additional condition that: $P=\pi_1(Q)=\pi_2(R)$, where $\pi_1$ and $\pi_2$ are ...
0answers
75 views

### Mixed integer formulation of union of polytopes?

Given $t$ different unbounded polyhedra $P_1:A^{(1)}x^{(1)}\leq b^{(1)},\dots,P_t:A^{(t)}x^{(t)}\leq b^{(t)}$ we are looking for the representation of $\bigcup_{i=1}^tP_i$ (not their convex hull) with ...
1answer
352 views

### What is the average area of the shadow of a convex shape taken over all possible orientations?

If we take a sphere, its surface area is exactly 4 times the area of its shadow. How can it be generalised for any convex shape?
0answers
123 views

### Is there a method to cut a hypercube into disjoint cubes [closed]

Since Borsuk conjecture hold for centrally symmetric convex sets in $\mathbb{R}^n$ so we can cut a hypercube into at least $n+1$ disjoint parts. Is there a method how can one do that?