Convex polytopes are the convex hulls of a finite set of points in Euclidean spaces. They have rich combinatorial, arithmetic, and metrical theory, and are related to toric varieties and to linear programming

learn more… | top users | synonyms

31
votes
0answers
650 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 ...
27
votes
0answers
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$, ...
17
votes
0answers
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
0answers
212 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 ...
12
votes
0answers
130 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
0answers
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
0answers
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
0answers
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
0answers
94 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., ...
10
votes
0answers
265 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 ...
8
votes
0answers
172 views

Does there always exist a self dual polytope that contains a given polytope contained in its dual?

Suppose a polytope $P$ is contained in its dual polytope $\tilde{P}$. Does there always exist a polytope $Q$ that contains $P$ and is self dual $Q=\tilde{Q}$? Is there any bound on the minimal number ...
7
votes
0answers
100 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 ...
7
votes
0answers
188 views

Right-angled polytopes

%This question is motivated by the little discussion here at the bottom. The following thing are known about hyperbolic right-angled polytopes: Compact hyperbolic right-angled polytopes do not ...
7
votes
0answers
190 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
0answers
119 views

Sampling from a Convex Body with Many Extremal Points

Let $p_{1}, \ldots, p_{N}$ be a collection of points in $\mathbb{R}^{n}$. I would like to sample uniformly from the convex hull of these $N$ points in an `efficienct' way. In my setting, I have $n$ ...
6
votes
0answers
130 views

An affine invariant of convex bodies

The following invariants of "pointed" convex bodies (i.e., pairs consisting of a convex body and a distinguished point in its interior) roughly measure how many of its linear images fit between the ...
6
votes
0answers
256 views

A question about a blue fan and a red fan and their common refinement

Is the following conjecture true? Conjecture: Let $M_1$ be a red map and let $M_2$ be a blue map drawn in general position on $S^n$, and let $M$ be their common refinement. There is a vertex $w$ of ...
6
votes
0answers
467 views

Counting Lattice Points in Real Polytopes

Suppose one did have an exact formula for the number of $\mathbb{Z}^n$-lattice points intersecting an arbitrary dilate of a (not necessarily rational) finite, closed and convex $n$-polytope. As a ...
5
votes
0answers
105 views

Geometry of the metric cone

Let us say that two metrics $d$ and $d_0$ on a set $X$ are related if there exist positive constants $0 < \alpha \leq \beta$ such that $$ \alpha \,\left(d_0(x,y) + d_0(y,z) - d_0(x,z)\right) \leq ...
5
votes
0answers
69 views

Classifying two-faces of four-polytopes

Motivation: This question is related to my study of hyperbolic Coxeter polytopes. In general, if one put some restrictions on the type of their dihedral angles (say, all dihedral angles are equal to ...
5
votes
0answers
160 views

4D polytope analogues of the icosahedron/Rogers-Ramanujan continued fraction relationship?

The formula for the j-function which employs polynomial invariants of the icosahedron, $$j(\tau)=-\frac{(r^{20} - 228r^{15} + 494r^{10} + 228r^5 + 1)^3}{r^5(r^{10} + 11r^5 - 1)^5}$$ where, ...
5
votes
0answers
201 views

Lattice points inside a (n-dimensional) tetrahedron

Hi, overflowers. I was interested in a sharp lower bound for the number of lattice points (say, integral lattice points) inside the tetrahedron defined by the coordinate hyperplanes and ...
5
votes
0answers
94 views

Regularity of simplices, part deux

This question is directly inspired by Pietro Majer's question and my answer to it. One can define a simplex, and the dihedral angles thereof in an infinite dimensional Hilbert space (one has to take ...
5
votes
0answers
182 views

A polytope associated with the Hadamard Transform

In an investigation of whether or not a subset $V$ of "Hamming Space" $M_n = \mathbb{F}_2^n$ is a tile (i.e. whether $M_n$ can be written as a disjoint partition of translates of $V$) in ...
5
votes
0answers
393 views

Reference for this polyhedral lemma

Recall the definition of a fan: Let $U$ be a finite dimensional real vector space. Then a fan is a collection $\mathcal{F}$ of cones in $U$ such that (1) If $\sigma \in \mathcal{F}$ and $\tau$ is a ...
5
votes
0answers
430 views

When should a moment polytope have “smooth” faces?

A codimension $d$ face of a polytope is called rationally smooth if it lies on only $d$ facets, because this is exactly the condition for the corresponding toric variety to have only orbifold ...
4
votes
0answers
65 views

How many facets can $\{\|D^T x\|_1\leq 1\}$ have?

$\newcommand{\RR}{\mathbb{R}}$Consider $x\in\RR^n$ and $D\in \RR^{n\times p}$ with $p\geq n$ and full rank. My question is: How many facets can the polytope $ \{x\in\RR^n\ :\ \|D^T x\|_1\leq 1\}$ ...
4
votes
0answers
120 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:             ...
4
votes
0answers
169 views

Wasserstein distance, convex polytopes and extreme points

Let us consider convex polytopes with $K$ extreme points in $\mathbb{R}^d$. Let $\mathbf{P}$ be such polytope, and let $\text{ext}(\mathbf{P})$ denote its set of extreme points, so that $\mathbf{P} = ...
4
votes
0answers
178 views

What's the best way to test if a sphere is a polytope? (algorithms for the Simplicial Steinitz Problem)

The problem of recognizing whether a simplicial face lattice is polytopal is sometimes called the Steinitz problem. Sturmfels and Bokowski advanced a set of methods in the late 80s to test whether ...
3
votes
0answers
47 views

Polynomials connected with Gale's condition and cyclic polytopes

I was reading about cyclic polytopes and (I think naturally) became interested in polynomials $f(X) \in \mathbb{R}[X]$ which have a factorization of the form $f(X)=g(X)g(X+1)$ for some $g(X) \in ...
3
votes
0answers
44 views

Minimax-like theorems involving union and intersection of regions in $\mathbb R^d$

From Minimax theorems, we roughly know that if $f(x,y)$ is convex on $X$ and concave $Y$ for both compact $X,Y$, then: $$ \max_{x\in X}\min_{y\in Y} f(x,y)=\min_{y\in Y}\max_{x\in X} f(x,y). $$ We can ...
3
votes
0answers
70 views

Unimodular triangulation and Ehrhart polynomials

Let $P$ be a convex lattice polytope. Then it has a polynomial Ehrhart function. I am interested in what can be said about the Ehrhart polynomial when $P$ has any of the properties is integrally ...
3
votes
0answers
103 views

Triangulations of special polyhedra

Let $A_1,A_2,A_3 \in \mathbb{N}^3$ be three points in space all lying in some plane $x+y+z=d$ where $d$ is a positive integer. If $\{e_1,e_2,e_3\}$ is the standard basis in $\mathbb{R}^3$, we can ...
3
votes
0answers
114 views

n-dimensional Delaunay Triangulation of Lattices

I have several questions concerning the Delaunay triangulation of a high dimensional lattice. Given an $n$-dimensional lattice $L$ and its Delaunay triangulation (partition of $R^n$ into simplices ...
3
votes
0answers
133 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 ...
3
votes
0answers
79 views

Covering points with a convex hull

Consider a set of $n$ points $x_1,\ldots,x_n \in \mathbb{R}^d$, for some $n \gg d$. Suppose $\{x_1,\ldots,x_n\} \subset C \subset \mathbb{R}^d$. Say that a set of points $y_1,\ldots,y_m \in C$ covers ...
3
votes
0answers
85 views

Versions of Helly's Theorem for Unbounded Parallelpipeds

I'm studying Frobenius splitting of toric varieties based on Sam Payne's characterization of Frobenius splitting ("Frobenius splittings of toric varieties" (2008)) and I came across a sort of Helly's ...
3
votes
0answers
233 views

Place n telescopes on a sphere in R^d to see the whole sky

Where would one put $n$ telescopes on the surface of the earth to see the whole sky as well as possible ? Use the cosine metric to define how well we can see in direction $x$: $ \qquad \text{cansee}( ...
3
votes
0answers
143 views

An isoperimetric inequality for “order” polytopes

I am looking for an isoperimetric inequality for order-like polytopes. An order polytope $K\in \mathbb{R}^n$ is defined by a set of linear inequaities: $$ \forall i \; 0\leq x_i \leq 1 $$ and $ ...
3
votes
0answers
186 views

Bell polytopes with nontrivial symmetries

Take $N$ parties, each of which receives an input $s_i \in {1, \dots, m_i}$ and produces an output $r_i \in {1, \dots, r_i}$, possibly in a nondeterministic manner. We are interested in joint ...
3
votes
0answers
212 views

Maximum of a function on $d-$dimensional convex compact sets

Let $\mathcal C_d$ denote the set of all $d-$dimensional convex compact subsets with barycenter at the origin of the $d$-dimensional Euclidean space $\mathbb E^d$. Given an element $C\in\mathcal C_d$ ...
3
votes
0answers
152 views

Collapsing the medial axis of a polytope

Let X be a convex polyhedron in hyperbolic 3-space. Let M be the medial axis of X. Question: Is M collapsible? It is easy to see that M is contractable. In the case of Euclidian 3-space, instead ...
2
votes
0answers
47 views

Generators for lattice polytopes

Let $V$ be a finite set of integral vectors in $\mathbb{R}_n$. Consider the real (positive) convex cone $\mathbb{R}^+V$ spanned by $V$. We can assume that all vectors in $V$ are extremal in ...
2
votes
0answers
146 views

Cavalieri's principle and inversion of the Vandermonde matrix

There are many examples on the Web of the use of Cavalieri's principle in determining areas and volumes of 2-D and 3-D geometrical figures. The Wikipedia link uses the principle as both a proof and ...
2
votes
0answers
61 views

Simplex in convex polytope, pulling triangulation

Let $P$ be a convex $d$-dimensional polytope. I have two questions, related to triangulations of $P$. Question 1: Let $p$ be in the interior of $P$. Can I always find a triangulation of $P$, such ...
2
votes
0answers
246 views

Convex hulls of compact sets

Let $A$ be a compact set in a separable Hilbert space $H$, and let $\bar A$ denote its convex hull. Is $\bar A$ compact?
2
votes
0answers
82 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
0answers
93 views

Definition of self-dual polytope

Given a d-polytope $P$ we define the c-dual polytope as $P^\ast = \{y\in R^d \mid x\cdot y\geq -c, \forall x\in P\}$. Then I say that a polytope is c-polar self-dual if $P=P^\ast$. I cannot find this ...
2
votes
0answers
123 views

existence of lattice point in polytope

This question was probably asked before but here goes. I have a convex polytope given by $Ax\leq b$ for a specific integer matrix $A$ and integer vector $b$. I need a simple method/result on how to ...