The polyhedra tag has no usage guidance.

**10**

votes

**0**answers

673 views

### Making a convex polyhedron with two sheets of paper

Suppose that we have two sheets of paper $S,T$ and that each of $S,T$ is in the shape of a convex quadrilateral. Also, suppose that the length of the perimeter of $S$ equals that of $T$. (Note that ...

**8**

votes

**0**answers

222 views

### Bi-spherical polyhedra

Bicentric polygons have been studied: a polygon all of whose vertices lie on its
circumcirle, and whose incircle is tangent to every edge:
I have not been able to find a comparable literature ...

**6**

votes

**0**answers

143 views

### Which -icial sets produce the “standard” representations of symmetric groups?

Suppose you have a system of cell complexes (say, even convex polyhedra) $(P_n)_{n\geqslant0}$ which occur as faces of each other and are used to define the corresponding notion of "$P_*$-set". So ...

**6**

votes

**0**answers

116 views

### Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between edges are rational multiples of $\pi$?

After reading these very interesting questions, I came up with another one:
Does every convex polyhedron have a combinatorially isomorphic counterpart whose angles between all pairs of edges meeting ...

**6**

votes

**0**answers

82 views

### Constructing a polyhedron of maximal possible volume from given bounds on areas of its faces

Consider $n$ variables $a_1,...,a_n$ ranging over $\mathbb{R}^+$. Suppose we are given $n$ pairs of positive rational numbers $(p_1,q_1),...,(p_n,q_n)$ where each pair imposes bounds on the ...

**5**

votes

**0**answers

308 views

### Maximum volume convex body coverable by a unit square

Suppose you are given a single unit square, and you are permitted to cut it into $k$ (connected)
pieces (where $k=1$ means just the square). Your task is to construct the largest volume
convex body ...

**4**

votes

**0**answers

217 views

### Regular cross-sections of a dodecahedron; analogous sections of 4-polytopes

One can intersect a dodecahedron with a plane and
obtain an equilateral triangle, a square, a regular pentagon,
a regular hexagon, and a regular decagon:
...

**3**

votes

**0**answers

67 views

### Which (polytopal) fans/polytopes are secondary?

Let $P$ be a (d-1)-dimensional polytope with $n$ vertices that sits in an affine hyperplane in $\mathbb{R}^d$.
The secondary fan of $P$ is a polytopal fan in $\mathbb{R}^n$ with $d$-dimensional ...

**3**

votes

**0**answers

138 views

### Tetrahedra passing through a hole

Assume a plane $P\subset\mathbb R^3$ has a hole $H$, and that the hole is topologically a compact disc. Being so, $P\setminus H$ does not separate the space. A regular tetrahedron $\sigma^3$ (of ...

**2**

votes

**0**answers

91 views

### The intersection of two $l_1$ balls

Let $B_1$ and $B_2$ be two balls in $\mathbb{R}^n$ with respect to the $l_1$ norm that have different radii and different centers. Is there an upper bound for the number of vertices that $B_1\cap ...

**2**

votes

**0**answers

100 views

### Convex polyhedra jammed in $k$ disjoint holes

For a given convex polyhedron $P \subset \mathbb{R}^3$,
I was imagining finding the optimal "fixing" of $P$ in holes (or jamming them in "mud"),
which led to the following question.
First, scale $P$ ...

**2**

votes

**0**answers

85 views

### Criteria to decide whether a subset of the boundary complex of a polyhedron is a manifold?

Let $\mathcal{P} \subseteq \mathbb{R}^d$ be a convex polyhedron. Let $K$ be a subset of the boundary complex of $\mathcal{P}$. (Perhaps $K$ could be defined in terms of a system of linear ...

**0**

votes

**0**answers

25 views

### Under what conditions is the unison of conic hulls of sets in a cartesian product equal to $\mathbb{R}^N$?

Question: Under what conditions on $A, B\in\mathbb{R}^{N\times N}$ is the function $f: \mathbb{R}^N\mapsto \mathbb{R}^N$,
$$f(v) = A[v]_+ + B[-v]_+$$
surjective? Here $[.]_+$ is an elementwise ...

**0**

votes

**0**answers

51 views

### Number of faces of polytope projecting to lower dimensional polyhedron

Denote $K=\mathrm{conv}(v_1, \ldots, v_n)\subsetneq\Bbb R^m$ to be convex set spanned by vectors $v_i\in\Bbb R^m$ with $m\leq n$ then what technique could be useful to upper bound minimum number of ...

**0**

votes

**0**answers

94 views

### Convex Polyhedra with Largest Constant Dihedral Angle for Given Number of Faces

Which $20$ faced convex polyhedron has the largest constant dihedral angle?
Which $24$ faced convex polyhedron has the largest constant dihedral angle?
Also, what about $30$ or $32$ faced polyhedra? ...