**49**

votes

**1**answer

4k views

### The amplituhedron minus the physics

Is it possible to appreciate the geometric/polytopal properties of the amplituhedron without delving into the physics that gave rise to it?
All the descriptions I've so far encountered assume ...

**43**

votes

**8**answers

5k views

### Fair but irregular polyhedral dice

I am interested in determining a collection of geometric conditions that will guarantee that a convex polyhedron
of $n$ faces is a fair die in the sense that, upon random rolling, it has an equal ...

**42**

votes

**1**answer

2k views

### two tetrahedra in R^4

It is relatively easy to show (see below) that if we have two equilateral triangles of side 1 in $R^3$,
such that their union has diameter 1, then they must share a vertex.
I wonder whether we have an ...

**36**

votes

**4**answers

2k views

### Polynomial roots and convexity

A couple of years ago, I came up with the following question, to which I have no
answer to this day. I have asked a few people about this, most of my teachers and some
friends, but noone had ever ...

**34**

votes

**0**answers

720 views

### Intersecting Family of Triangulations

Let $\cal T_n$ be the family of all triangulations on an $n$-gon using $(n-3)$ non-intersecting diagonals. The number of triangulations in $\cal T_n$ is $C_{n-2}$ the $(n-2)$th Catalan number. Let ...

**33**

votes

**2**answers

1k views

### Do plane projections determine a convex polytope?

Suppose a compact convex body $P \subset \Bbb R^3$ has only polygonal orthogonal projections onto a plane. Does this imply that $P$ is a convex polytope?
This question occurred to me when I was ...

**27**

votes

**4**answers

1k views

### Probability of zero in a random matrix

Let $M(n,k)$ be the set of $n\times n$ matrices of nonnegative integers such that every row and every column sums to $k$. Let $P(n,k)$ be the fraction of such matrices which have no zero entries, ...

**27**

votes

**0**answers

2k views

### A Combinatorial Abstraction for The “Polynomial Hirsch Conjecture”

Consider $t$ disjoint families of subsets of {1,2,…,n}, ${\cal F}_1,{\cal F_2},\dots {\cal F_t}$ .
Suppose that
(*)
For every $i \lt j \lt k$
and every $R \in {\cal F}_i$, and $T \in {\cal F}_k$, ...

**26**

votes

**2**answers

857 views

### Bodies of constant width?

In two-dimensional case one can generalize figures of constant width as figures which can rotate in a covex polygon.
Here is one example which can be used to drill triangular holes:
I would like to ...

**21**

votes

**4**answers

573 views

### Is the diameter of a centrally symmetric convex body realized by a pair of antipodal points?

Let $S \subset \mathbb{R}^n$ be the boundary of a centrally symmetric convex body and provide $S$ with the geodesic metric given by its embedding in Euclidean space (i.e., the distance between two ...

**21**

votes

**3**answers

2k views

### How many different numbers can be obtained as product of first $n$ natural numbers?

Let m and n be natural numbers, and consider the set of all possible products of m (not necessarily distinct) elements from the set $\{1,2,\ldots,n\}$, that is consider the set
$\{1^{a_1} \cdot ...

**21**

votes

**2**answers

452 views

### Convex hull of total orders

Let $n$ be a positive integer and $\prec$ an arbitray total order on $\{1,\dots,n\}$. I associate to this order a vector $v$ with one coordinate for every pair $(i,j)$ s.t. $1\leq i\neq j \leq n$, by ...

**21**

votes

**4**answers

1k views

### Ellipse naturally associated with a polygon

My colleagues and I have stumbled onto a way to associate an ellipse, or equivalently a positive definite symmetric matrix, to a polygon that is different from other better known ways. We want to know ...

**21**

votes

**2**answers

1k views

### The logic of convex sets

Let me start with Helly's theorem: Let $A_1$, $A_2$, ..., $A_{n+2}$ be $n+2$ convex subsets of $\mathbb R^n$. If any $n+1$ of these subsets intersect (this means: have nonempty intersection), the so ...

**19**

votes

**4**answers

584 views

### Do random projections (approximately) preserve convexity?

The Johnson-Lindenstrauss lemma implies that any set of $k$ points in $\mathbb{R}^d$ can be randomly projected into $d' \approx \log(k)/\epsilon^2$ dimensions such that the distances between each pair ...

**17**

votes

**9**answers

4k views

### Open problems in Euclidean geometry ?

Which are some (research level) open problems in Euclidean geometry ?
(Edit: I ask just out of curiosity, to understand how -and if- nowadays this is not a "dead" field yet)
I should clarify a ...

**17**

votes

**4**answers

680 views

### The Constructions of Davis and Januszkiewicz

One of the most useful tools in the study of convex polytope is to move from polytopes (through their fans) to toric varieties and see how properties of the associated toric variety reflects back on ...

**17**

votes

**0**answers

2k views

### Why do polytopes pop up in Lagrange inversion?

I'd be interested in hearing people's viewpoints on this. Looking for an intuitive perspective. See Wikipedia for descriptions of polytopes and the Lagrange inversion theorem/formula (LIF) for ...

**16**

votes

**3**answers

1k views

### Cutting convex sets

Any bounded convex set of the Euclidean plane can be cut into two convex pieces of equal area and circumference.
Can one cut every bounded convex set of the Euclidean plane into an arbitrary number ...

**16**

votes

**2**answers

398 views

### What is $A+A^T$ when $A$ is row-stochastic ?

This is motivated by this MO question.
If $A\in{\bf M}_n({\mathbb R})$ is row-stochastic (entrywise non-negative, and $\sum_j a_{ij}=1$ for all $i$), then $M:=A+A^T$ is
symmetric,
entrywise ...

**16**

votes

**1**answer

648 views

### About a Delzant polytope. (In particular dodecahedron)

Hi. I have a question.
Definition. Delzant polytope $P$ is a rational convex simple polytope with the smooth condition. Here, "smooth" means that for each vertex $v$, the $n$ edges containing $v$ ...

**16**

votes

**0**answers

213 views

### “Japanese Theorem” on cyclic polygons: Higher-dimensional generalizations?

A beautiful theorem known as the Japanese Theorem (Wikipedia, MathWorld)
says that, no matter how one triangulates a cyclic (inscribed in a circle) polygon,
the sum of the radii of the incircles is ...

**15**

votes

**9**answers

7k views

### Algorithm for finding the volume of a convex polytope

It's easy to find the area of a convex polygon by division into triangles, but what is the optimal way of finding the volume of higher-dimensional convex bodies? I tried a few methods for dividing ...

**15**

votes

**12**answers

3k views

### Generalizations of the Birkhoff-von Neumann Theorem

The famous Birkhoff-von Neumann theorem asserts that every doubly stochastic matrix can be written as a convex combination of permutation matrices.
The question is to point out different ...

**15**

votes

**2**answers

480 views

### “Derived” polyhedra and polytopes

The notion of derived polygon is natural and leads to remarkable convergence.
Start with a polygon, and replace it by locating a point on every edge
a fraction $\alpha$ between the two endpoints. For ...

**15**

votes

**1**answer

332 views

### Does every convex polyhedron have a combinatorially isomorphic counterpart whose all faces have rational areas?

Does every convex polyhedron have a combinatorially isomorphic counterpart whose faces all have rational areas?
Does every convex polyhedron have a combinatorially isomorphic counterpart whose edges ...

**14**

votes

**4**answers

1k views

### Can you determine whether a graph is the 1-skeleton of a polytope?

How do I test whether a given undirected graph is the 1-skeleton of a polytope?
How can I tell the dimension of a given 1-skeleton?

**14**

votes

**1**answer

576 views

### Totally rational polytopes

Define a convex polytope in $\mathbb{R}^d$ as
totally rational (my terminology)
if its vertex coordinates are rational, its edge lengths
are rational, its two-dimensional face areas are rational, ...

**13**

votes

**2**answers

683 views

### Sampling from the Birkhoff polytope

The set of $n\times n$ real, nonnegative matrices whose rows and columns sum to one forms the well-known Birkhoff polytope
Recently someone asked me if I knew
How to sample (in polynomial time) ...

**13**

votes

**3**answers

622 views

### Triangulations of polyhedra

A topologist came to me with this question, but everything I think should work doesn't.
How many triangulations are there of a polyhedron with n vertices?
By a "triangulation" of a polyhedron P we ...

**13**

votes

**2**answers

2k views

### How many vertices/edges/faces at most for a convex polyhedron that tiles space?

I wonder if this problem has already been examined before:
Consider a convex polyhedron that tiles $\mathbb R^3$. What is the maximum of vertices/edges/faces that such a polyhedron can have?
...

**13**

votes

**3**answers

646 views

### Is there a midsphere theorem for 4-polytopes?

The (remarkable) midsphere theorem says that each combinatorial
type of convex polyhedron may be realized by one all of whose edges are
tangent to a sphere
(and the realization is unique if the center ...

**13**

votes

**1**answer

199 views

### Smallest regular simplex containing the unit cube in $R^n$

What is the length $e_n$ of the edge of the smallest $n$-dimensional regular simplex $S_n$ containing the $n$-dimensional unit cube $Q_n$?
In particular, is there $n$ such that ...

**13**

votes

**0**answers

344 views

### Surface area of convex hull [duplicate]

Let Q be the convex hull of a non-convex polyhedron P. Is it true that the surface area of Q is not greater than the surface area of P?

**12**

votes

**4**answers

624 views

### Name of a polytope

What is the name of the polytope $\Sigma\cap (-\Sigma)$ for $\Sigma$ a $d-$simplex with barycenter at the origin?
In dimension $2$, one gets a hexagon, in dimension $3$ an octahedron (given by the ...

**12**

votes

**1**answer

630 views

### Optimal 8-vertex isoperimetric polyhedron?

I know from Marcel Berger's
Geometry Revealed:
A Jacob's Ladder to Modern Higher Geometry
(p.531)
that it is not yet established which polyhedron in $\mathbb{R}^3$ on 8 vertices achieves the optimal ...

**12**

votes

**0**answers

131 views

### realization spaces of 3-dimensional polytopes

It is a well-know result (Steinitz, 1922) that the realization space of 3-dimensional convex polytopes with fixed combinatorics is contractible.
A proof of this theorem can be found for instance in ...

**11**

votes

**5**answers

1k views

### On the number of Archimedean solids

Does anyone know of any good resources for the proof of the number of Archimedean solids (also known as semiregular polyhedra)?
I have seen a couple of algebraic discussions but no true proof. Also, ...

**11**

votes

**5**answers

729 views

### A characterization of convexity

While doing some research on polytopes I came to the following question. Maybe it's already somewhere but anyway I'll post it here.
Let $X\subset \mathbb{R}^3$ be such that, for every plane $P$, ...

**11**

votes

**2**answers

961 views

### Combinatorics of the Stasheff polytopes

First a little background for those unaware. The Stasheff polytopes (or associahedra) are certain convex polytopes that arise in the theory of $A_\infty$-algebras. There is one polytope for each ...

**11**

votes

**1**answer

348 views

### Can all convex polytopes be realized with vertices on surface of convex body?

The following question was asked by me on Mathematics.SE. Unfortunately, no one answered it so I thought I might give it a try one level higher. Below the line you can find the slightly edited ...

**11**

votes

**2**answers

2k views

### Weighted area of a Voronoi cell

Let $X = \{ x_1,\dots,x_n\} $ denote a set of $n$ points in the unit square $S = [0,1]\times[0,1]$, and let $w = \{w_1,\dots,w_n\}$ denote a set of weights corresponding to the $n$ points in $X$. ...

**11**

votes

**1**answer

394 views

### Does a triangulation without fixed simplex property always exist?

Suppose we are given a triangulable topological space $X$. If $X$ has the fixed point property (FPP), then obviously for every triangulation $K$ of $X$ and every simplicial map $f:K\to K$ a simplex ...

**11**

votes

**3**answers

1k views

### When are Ehrhart functions of compact convex sets polynomials?

Given a lattice $L$ and a subset $P\subset \mathbb R^d$, we define for each positive integer $t$ $$f_P(L,t)=|(tP\cap L)|$$ the number of lattice points in $tP$. Let's say $P$ is nice if $f_P(L,t)$ is ...

**11**

votes

**2**answers

803 views

### Are the Platonic solids shadows of 4-polytopes?

Say that a 3D shadow of a 4-polytope is a parallel projection to 3-space, not necessarily orthogonal to that 3-space (that would make it an orthogonal projection).
I am wondering if each of the five ...

**11**

votes

**0**answers

104 views

### Higher dimensional generalization of: Any quadrilateral tiles the plane?

Any (non-self-intersecting) quadrilateral tiles the plane.
(MathWorld image.)
Q. What is the strongest known generalization of this statement to higher dimensions?
I.e., ...

**11**

votes

**0**answers

358 views

### Reciprocity (Ehrhart-style) for real polytopes?

Is there some sense in which the well-known Ehrhart reciprocity law for rational, convex, polytopes can be extended to any convex polytope with arbitrary real vertices?
In other words, given any ...

**11**

votes

**0**answers

315 views

### Lower Bound on the Volume of Certain Polytopes

Given a partition $\rho\in\mathcal{P}(n)$ with $k$ blocks
$$
\rho=\{B_1,B_2,\ldots,B_{k}\}
$$
we can define the set of equations
$$
E_{i}:\sum_{j \in B_{i}}{x_{j-1}}=\sum_{j \in ...

**11**

votes

**0**answers

657 views

### Constructive aspects of Caratheodory's theorem in convex analysis

Let me paraphrase Caratheodory's theorem in a probabilistic setup:
Let $X$ be a real-valued random variable. For $k = 1, \ldots, m$, let $f_k: \mathbb{R} \to \mathbb{R}$ be a continuous function such ...

**10**

votes

**2**answers

517 views

### Efficiently determine if convex hull contains the unit ball

Given a set of $n$ points in $\mathbb{R}^d$, is there an algorithm to determine if the convex hull contains the unit ball centered at the origin in polynomial time? The convex hull itself might have ...