Skip to main content

Questions tagged [polyhedra]

For questions related to polyhedra and their properties.

6 votes
3 answers
286 views

We add a little to On reconstructing convex polyhedrons from disconnected faces that are all mutually non congruent We call a set of polygonal regions that all together form a convex polyhedron a ‘...
Nandakumar R's user avatar
  • 7,251
5 votes
1 answer
173 views

Ref: https://arxiv.org/pdf/1307.3472 It is well known that given only a set of convex polygonal regions (call this set of polygons a 'face set') and no further information, one cannot uniquely ...
Nandakumar R's user avatar
  • 7,251
10 votes
0 answers
304 views

It has recently been proven that the 2017 conjecture that all convex polyhedra $P$ are Rupert is false: "A convex polyhedron without Rupert's property," Jakob Steininger, Sergey Yurkevich. ...
Joseph O'Rourke's user avatar
25 votes
2 answers
867 views

This question resisted attacks at MSE. A tetrahedron's vertices are independent uniformly random points on a sphere. What is the probability that the tetrahedron's four faces are all acute triangles? ...
Dan's user avatar
  • 5,039
5 votes
1 answer
254 views

The vertices of a tetrahedron are independent and uniform random points on a sphere. What is the expectation of the internal angle between faces? Simulation suggests $\frac{3\pi}{8}$ I simulated $10^...
Dan's user avatar
  • 5,039
1 vote
0 answers
168 views

The same question was asked on SE https://math.stackexchange.com/questions/5075489/prove-that-at-least-two-edges-of-a-polyhedron-does-not-intersect-a-given-plane Let $P$ be a polyhedron (not ...
JetfiRex's user avatar
  • 1,153
5 votes
0 answers
111 views

It seems that the following statement can be proved using a Voronoi--Delaunay-type argument. Is there a reference? Let $P \subset \mathbb{R}^n$ be a compact subset (it is OK to assume that $P$ is a ...
Anton Petrunin's user avatar
6 votes
0 answers
186 views

Let ${M} = \{M_1, M_2, \dots, M_N\}$ be the set of all noncrossing perfect matchings on a circle with $2n$ labeled points arranged clockwise. Then $N = \frac{1}{n+1} \binom{2n}{n}$ is the $n$-th ...
Zhaopeng Ding's user avatar
2 votes
1 answer
204 views

Here is my question: As we know, for a string-type Coxeter diagram such as $$\circ\overset{p}{---}\circ \overset{q}{---}\circ \overset{r}{---}\circ \cdots \circ $$ where $p,q,r,\ldots$ are integers ...
zemora's user avatar
  • 673
1 vote
0 answers
71 views

For a 3-uniform hypergraph $H$ on a finite vertex set $V$, i.e., $H\subseteq \binom{V}{3}$, we assume $H$ has no isolated vertices and is connected (no non-trivial partition of $V$ such that each edge ...
Connor's user avatar
  • 551
2 votes
1 answer
145 views

Consider a 4-valent Cayley graph generated by long cycle $(1,2,3,...,n)$ and n-1 cycle $(1,2,3,...n-1)$. (See the beautiful image from Wikipedia below for n=4). Question 1: Are there convex ...
Alexander Chervov's user avatar
3 votes
1 answer
258 views

Consider Associahedron, consider graph build from its vertices and edges. Choose some vertex. Let us count the number of vertices on distances $k$ from the selected vertex. Write a generating ...
Alexander Chervov's user avatar
1 vote
0 answers
120 views

Encouraged by the positive solutions to my question, Tiling with one of each shape, I'd like to pose the $\mathbb{R}^3$ equivalent: Q. Is there a tiling of $\mathbb{R}^3$ by (bounded) polyhedra, one ...
Joseph O'Rourke's user avatar
0 votes
0 answers
49 views

Question: given $k,\,k>n$ points in convex configuration and general position in $n$ dimensional Euclidean space, i.e. no $n+1$ points of which are co-hyperplanar, what can be said about how the ...
Manfred Weis's user avatar
14 votes
1 answer
695 views

Last week, I read Wikipedia's article on Alexander Grothendieck. It lists his twelve greatest contributions to mathematics as accounted for in Grothendieck's own Récoltes et Semailles. The final item ...
Kepler's Triangle's user avatar

15 30 50 per page
1
2 3 4 5
18