8
votes
1answer
401 views

Polyhedron not circumscribed about a sphere

Let $P$ be a polyhedron whose faces are colored black and white so that there are more black faces and no two black faces are adjacent. Show that $P$ is not circumscribed about a sphere. My teacher ...
8
votes
3answers
627 views

On maximal regular polyhedra inscribed in a regular polyhedron

Let T, C, O, D, or I be regular tetrahedron, cube, octahedron, dodecahedron, and icosahedron, respectively. Suppose that the outer polyhedron have edge-length 1. For example, it's easy to prove that ...
9
votes
2answers
208 views

Do maximal polyhedra have algebraic volume?

Is it possible to prove that for every $n > 3$ the maximal possible volume of a convex polyhedron having $n$ vertices inscribed in a sphere of unit radius is an algebraic number? Update: What ...
2
votes
0answers
73 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 ...
8
votes
1answer
271 views

Complexity of the union of randomly rotated unit cubes

It is a remarkable fact that the union of congrent cubes has only at most near-quadratic combinatorial complexity, $O^*(n^2)$ for $n$ cubes, known to be almost tight. This contrasts with the union of ...
6
votes
2answers
183 views

Volumes of convex vs non-convex polyhedra with prescribed facets areas

It is known that given a set of Areas $A_f$ and normals $\vec{n}_f$ if $\sum_f A_f \vec{n}_f=0$ exist a unique convex polyhedron with given face areas and normals. (Minkowski theorem - See Alexandrov ...
8
votes
1answer
371 views

Polyhedra that combinatorially shadow a sequence

Let $P$ be a polyhedron in $\mathbb{R}^3$. Say that $P$ combinatorially shadows a sequence of natural numbers $S$ if there is a continuous rotation of $P$ such that its orthogonal-projection shadows ...
21
votes
1answer
983 views

Building a genus-$n$ torus from cubes

I wonder if this has been studied: What is the fewest number of unit cubes from which one can build an $n$-toroid? The cubes must be glued face-to-face, and the boundary of the resulting ...
10
votes
2answers
275 views

Acute triangulation

Assume that $S$ is a finite 2-dimensional simplicial complex equipped with a metric $d$ such that each triangle is isometric to a plane triangle (so $(S,d)$ is a polyhedral space). Is it possible ...
10
votes
0answers
266 views

Update to Shephard's “Twenty Problems on Convex Polyhedra”

Forty-three years ago, Geoffrey Shephard published an influential list of open problems on convex polyhedra. Progress has been made on several of his problems, and perhaps some have been completely ...
17
votes
2answers
786 views

Placing points on a sphere so that no 3 lie close to the same plane

Motivation I am working with arbitrary parallelopiped tilings given by projection from a higher dimensional space. The collection of tiles, and some properties of the higher dimensional space are ...
30
votes
1answer
1k views

Pach's “Animals”: What if genus $> 0$ ?

Janos Pach asked a deep question 23 years ago (1988) that remains unsolved today: Can every animal—a topological ball in $\mathbb{R^3}$ composed of unit cubes glued face-to-face—be ...