**1**

vote

**2**answers

224 views

### Secondary Polytope Simplicial?

Is the secondary polytope of a simplicial polytope necessarily simplicial?

**1**

vote

**1**answer

110 views

### Decide inside/outside convex hull using only distances in graph

Given a weighted, undirected graph G with K knodes k1 … kK. I have a K times K matrix containing the shortest distances between each pair of points.
Is it possible (if yes how), to decide if a point ...

**6**

votes

**2**answers

1k views

### How many vertices can a convex polytope have?

One has an $n$-dimensional convex polytope $P$ represented by an intersection of half-spaces:
\begin{equation}H_i = \{ (x_1,x_2, \ldots,x_n) \in \mathbb{R}^n \mid \sum_{j=1}^n a_{ij} x_j \ge a_{i0}, ...

**5**

votes

**0**answers

210 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 ...

**2**

votes

**0**answers

43 views

### Conditions under which a set of points have a low weight representation under some basis

Let $S \subset R^d$ be a convex polytope in $d$ dimensional real space. Say that $S$ has weight $w$ if there exists some basis $x_1,\ldots,x_d$ such that for every point $v \in S$, we can write $v = ...

**8**

votes

**0**answers

178 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 ...

**3**

votes

**3**answers

389 views

### Find a convex hull that contains given points?

Suppose that you have vectors $a_{1},...,a_{m}$ in $\mathbb{R}^n$. Can you take $n$ among them, let $v_{1},...,v_{n}$ such that $a_{1},...,a_{m}$ belong to the convex hull of ...

**1**

vote

**2**answers

134 views

### determining a convex set by mixed volumes

For a convex set $K \subset \mathbb{R}^2$ let $\phi_K:$ convexsets in $\mathbb{R}^2 \rightarrow [0,\infty), A \mapsto MV(A,K)$. Where by $MV(A,K)$ I mean the mixed volume of $A$ and $K$ in the ...

**16**

votes

**2**answers

407 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 ...

**4**

votes

**1**answer

202 views

### Extreme rays in the cone of (semi)metrics

How many extreme rays are there on the polytopal cone formed by all semimetrics on a set with $n$ elements?
Some background. Given a set $X$ with $n$ elements, the set of all semimetrics
$d:X \times ...

**1**

vote

**2**answers

217 views

### Volume of intersection of a convex polytope with an affine space.

Given an $n$-dimensional polytope $P\subset \mathbb{R}^n$.
For a subset of indices $i_1,\ldots,i_k$ of $\{1,\ldots,n\}$ and reals $a_1,\ldots,a_k$, we denote by ...

**3**

votes

**1**answer

281 views

### moduli space of polytopes

When considering classification problems about polytopes, I sometimes has the feeling that one need to talk about certain parametrized families, i.e. moduli space of such polytopes. But neither do I ...

**3**

votes

**1**answer

179 views

### Classification of lattice polytopes with small number of lattice points in the facets

Suppose $P$ is a convex lattice polytope in $Z^3$ without interior lattice points, and we require the interior lattice points of each facet(i.e. dimensional 2 faces) are neither too much nor too few, ...

**2**

votes

**2**answers

365 views

### Convex upper bound on a linear-fractional function

I have a function of the form $f(x,y) = \frac{x}{c+y}$ where $c$ is a positive constant, $c \ge x \ge 0$, and $y \ge 0$. I would like to find a convex upper-bound for this function. Is there a ...

**1**

vote

**0**answers

165 views

### Lattice-point enumeration question involving linear combinations of matrices

I would like to know some references to learn more about an answer to this question, if there are any references:
Let $A_1, \dots , A_m$ and $B$ be $n\times n$ symmetric matrices. Let $$S = \{(x_1, ...

**36**

votes

**0**answers

871 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 ...

**11**

votes

**0**answers

379 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 ...

**2**

votes

**2**answers

189 views

### Is there a simple test to determine whether a polytope is integral?

It is known that any rational convex polytope expressed as $\{ x\in\mathbb{R}^d : Ax \ge b \}$, where $A\in\mathbb{Z}^{k\times d}$ and $b\in\mathbb{Z}^k$, can be written as the convex hull of finitely ...

**1**

vote

**0**answers

154 views

### Compute generalized pentagram map

Hi,
(This is my first question on MathOverflow! :-)
Imagine you have a set of points $S = \{p_1, \ldots, p_n\}$ in $\mathbb{R}^d$, of which $t$ are "bad". I want to compute a "safe convex hull", ...

**8**

votes

**2**answers

359 views

### symmetries and faces of the associahedra

The dihedral group of order $2n+2$ acts on $K_n$, the $n-2$-dimensional associahedron. Are there any other symmetries? References?
Does the answer to 1 change if we restrict to just the 1-skeleton ...

**3**

votes

**3**answers

413 views

### reference for the cubical structure of the associahedra

I cannot find where I learned that the $n$-dimensional associahedron is a union of $n$-cubes. The vertices of the $n$-dimensional associahedron are the finite binary trees having $n+2$ leaves and ...

**8**

votes

**1**answer

617 views

### Approximating a convex function by a piecewise linear function

Suppose I have a Lipschitz-continuous convex function $f:\mathbb{R}^n\rightarrow \mathbb{R}$. I wish to approximate it on the unit ball by a piecewise-linear function $g:\mathbb{R}^n\rightarrow ...

**3**

votes

**1**answer

223 views

### Empty convex polytopes for random point sets

I know of the famous results on the Erdős-Szekeres empty convex polygon problem in the plane
(the Happy-Ending Problem), and I know that there are higher-dimensional extensions.
A great source ...

**4**

votes

**2**answers

301 views

### Realization spaces for regular convex polytopes

Q1.
Are there convex polytopes combinatorially equivalent to each of the regular polytopes
that are realized with integer vertex coordinates?
...

**11**

votes

**1**answer

364 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 ...

**1**

vote

**2**answers

477 views

### Does Euler's formula imply bounds on the degree of vertices in a 3-polytopal graph?

A corollary of Euler's formula tells us that the edge-vertex graph of every convex 3-polyhedron must have a face with either 3, 4, or 5 edges, using an argument about the average degree of vertices.
...

**19**

votes

**4**answers

616 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 ...

**1**

vote

**1**answer

346 views

### Question regard checking convexity by “restriction to any line that intersects the function domain”

Hello all,
I have a question (probably stupid one) about the fact that " A function is convex if and only if it is convex when restricted to any line that intersects its domain".
In Stephen Boyd and ...

**0**

votes

**0**answers

104 views

### Area of spherical polygons in high dimensions

Given 4 points on $S^3$. If we look at the spherical polygon formed on $S^3$, is there a formula for the 3-dimensional Hausdorff measure for it?
E.g.: When I tried to set up a spherical coordinate ...

**2**

votes

**1**answer

420 views

### Proving that a specific function is quasiconvex

Hello all,
Assume we have a sequence of quasiconcave functions (in $X$) denoted by $f_{i,j}(X)$ for $i,j = 1,\ldots,n$. Denote by $F(X)$ the $n\times n$ matrix whose $(i,j)$ entry is the function ...

**5**

votes

**0**answers

95 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 ...

**4**

votes

**1**answer

176 views

### Regularity of simplices

A triangle is regular, provided it is equilateral, or, also, equiangular. How these conditions generalize to characterizations of regularity of simplices?
In particular, it turns out that
a ...

**1**

vote

**1**answer

179 views

### Realizing not-quite-barycentric subdivision of a polytope

Given a poset $S$, one can form a new poset $I(S)$ whose elements are intervals in $S$ (i.e. either $\emptyset$ or $[a,b]$ for some $a\leq b\in S$) with ordering by (set) inclusion. If $S$ is ranked, ...

**3**

votes

**1**answer

736 views

### Complexity of convex polytope volume calculation ? (Volume of Voronoi cell) (Error probability)

Assume I have polytope in R^k given by N (k<< N) linear inequalities (A_i x < b_i).
I guess complexity of its volume calculate is higher than linear in "N", am I right ?
(Is the complexity ...

**3**

votes

**0**answers

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

**2**answers

294 views

### How to show that convex polytope is not a Voronoi cell?

Given a combinatorial type of a convex polytope, what techniques are available for showing that it cannot be realized as a Voronoi cell of some point system?

**17**

votes

**4**answers

717 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 ...

**2**

votes

**1**answer

149 views

### How can pushing a vertex in a polytope lead to merging facets?

I'm trying to understand the Lemma 2.2 and Corollary 2.3 of Francisco Santos paper "A counterexample to the Hirsch conjecture": http://arxiv.org/abs/1006.2814
Corollary 2.3 is a proof of a result of ...

**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, ...

**0**

votes

**1**answer

361 views

### The query concerning the Euler-Poincare formula’s generalizations

Euler's equation for polyhedral, Euler's polyhedral formula, V – E + F = 2, where V, E, and F, are the number of points, edges and faces, was discovered by Leonhard Euler in 1752. However, the basic ...

**4**

votes

**1**answer

240 views

### Is it possible to sample uniformly on the surface of a high-dimensional polytope?

There are some pretty simple methods to do uniform sampling on the surface of high-dimensional spheres or cubes.
Are there any methods that sample uniformly on the surface of a high-dimensional ...

**10**

votes

**1**answer

263 views

### Connecting Lemma in the Alexandrov's existence theorem.

At the moment I am polishing my lecture notes which in particular cover Alexandrov's existence theorem.
Denote by $\mathbf{P}_k$ the space of isometry classes of polyhedral
metrics on the $\mathbb ...

**6**

votes

**3**answers

263 views

### Inequality of arithmetic and geometric means for the lattice polytopes?

Let $K$,$L$,$M$ be convex lattice polytopes (so their vertices are in $\mathbb{Z}^n$) in $\mathbb{R}^n$ satisfying $K+L\subseteq M+M$ (Minkowski sum). Do we always have
...

**8**

votes

**1**answer

464 views

### Triangulations of polytopes and tilings of zonotopes

Consider a set $A = \{ a_1,a_2,\ldots, a_n \} $ of vectors in $\mathbb{R}^d$, which lie in a common affine hyperplane. Two convex polytopes may be obtained from $A$, namely the convex hull of the ...

**9**

votes

**2**answers

477 views

### Detecting tilings by toric geometry

This is probably a silly question, but I figured that if there is a good answer, this would be a good place to ask.
Ever since I got my hands on the book "Toric Varieties" by Cox, Little and Schenck, ...

**3**

votes

**1**answer

182 views

### The facial structure of the convex hull of a family of characteristic functions

Let $S$ be a finite set and let $\mathcal{A} \subset\mathcal{P}(S)$ be a family of subsets of $S$. Consider the convex polytope spanned by the characteristic functions of members of $\mathcal{A}$ :
...

**0**

votes

**0**answers

89 views

### centrally symmetric neighborly polytopes.

Let $P$ is centrally symmetric $k$ neighborly d-polytope. Let $ P^* $ is polar( also dual) of $ P $. Consider a polytope $ Q^* $ , $ Q^* \subset P^* $( not necessarily a face of $P^*$). By duality
...

**10**

votes

**0**answers

278 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 ...

**2**

votes

**1**answer

391 views

### faces of a polytope

Let $a_1,a_2,..,a_n\in\mathbb{R}^m$, $n>m$ and the points are in general position meaning, no hyperplane contains more than $m$ points. Define a polyhedron $$P=\{x\in\mathbb{R}^m:a_1'x\leq0, ...

**2**

votes

**2**answers

553 views

### Cone over the Join of two topological spaces

Suppose $X$ and $Y$ are topological spaces. Let's define the join $X\ast Y$ as the quotient space $X\times Y\times [0,1]/\sim$, where $\sim$ is the equivalence relation generated by ...