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

0
votes
0answers
43 views

What is number of faces in a k-ary n-dim cube? [on hold]

What is the number of $(n-r)$ dim faces for a $k$-ary $n$-dim cube ? Definition of k-ary cube: In a $k$- ary $n$- cube , each node is identified by an $n$-bit base-$k$ address $b_{n − ...
0
votes
0answers
43 views

Choosing the weights of a Voronoi diagram — is this function always the gradient of another function?

This question is related to the earlier question Weighted area of a Voronoi cell . As in that question, let $X = \{ x_1,\dots,x_n\} $ denote a set of $n$ points in the unit square $S = ...
1
vote
0answers
68 views

Properties of Coefficients of Order Polynomials

I am working on a problem involving determining the order polynomial $\Omega_P(k)$ of a partial order $P$, which counts the number of order-preserving transformations/maps from $P$ to the $k$-chain ...
3
votes
1answer
56 views

convex hull of the set of permutations with one cycle

is there a way to describe the convex hull of the set of permutation matrices with exactly one non-trivial cycle? or maybe I should ask for the convex hull of cycle matrices : let $(i_{1},..,i_{k})$ ...
4
votes
0answers
43 views

Algorithm to express a point from a H-polyhedron as convex combination of extreme points

Let $P\subset\mathbb{R}^n$ be a convex polyhedron described as an intersection of hyperspaces, that is, $$P:=\{\boldsymbol{x}: A\boldsymbol{x} \leq \boldsymbol{b}\}$$ Let $\boldsymbol{x} \in P$. We ...
3
votes
0answers
79 views

Combinatorial interpretation for a toric intersection number

Let $X$ be an $n$-dimensional toric variety and let $D$ be an effective divisor (eg nef or ample). Is there a combinatorial interpretation (eg in terms of the fan or polytope) of the intersection ...
3
votes
2answers
80 views

Has anyone developed a technique to generate a polytope given (possibly redundant) inequality constraints? [closed]

I've found a few papers that deal with removing redundant inequality constraints for linear programs, but I'm just trying to find the vertices for a feasible region, given a set of inequality ...
1
vote
0answers
49 views

Finding optimal linear transformation for intersection of convex polytopes

I previously posted this on MathSE and am now trying here. I have the following situation, as shown in the following diagram: $W=\{w_i\}_{i=1..|W|}$ is a set of vertices (show in diagram in ...
6
votes
1answer
147 views

Tighter Caratheodory on the moment curve?

The moment curve is the set of points of the form $$(t,t^2,t^3,...,t^n) \in R^n$$ Let $M$ be the portion of the moment curve where $t\in [0,1]$, and let $\overline{M}$ be the convex hull of $M$. ...
0
votes
0answers
24 views

Under what conditions is the unison of conic hulls of sets in a cartesian product equal to $\mathbb{R}^N$?

Question: Under what conditions on $A, B\in\mathbb{R}^{N\times N}$ is the function $f: \mathbb{R}^N\mapsto \mathbb{R}^N$, $$f(v) = A[v]_+ + B[-v]_+$$ surjective? Here $[.]_+$ is an elementwise ...
4
votes
2answers
86 views

Inscribed parallelotope in a $d$-simplex

The problem setup is simple: Given a $d$-simplex $\Delta_d:=\{(x_1,\cdots,x_d):x_i\geq 0,\sum_i x_i\leq 1\}$, can we construct a finite sequence of parallelotope $A_i$ so that $\Delta_d=\cup_{i=1}^N ...
0
votes
0answers
25 views

Inscribed polytopal approximation to a convex body

This question is on the continuation of the post Approximation of convex body by polytopes The central problem I am interested is an explicit construction of inscribed polytope with at most $n$ ...
3
votes
1answer
117 views

Find the minimum distance between two convex hulls

We work over $\mathbb{R}^N$. Let $\mathbf{P}_1$ denote the hyperplane constructed using $N$ points, each of which is on a different axis (there are $N$ axes). We denote by $\mathbf{P}_2$ the convex ...
5
votes
0answers
45 views

Measure-minimizing simplex with fixed inradius

Let $\Delta^n$ be an $n$-simplex in $\mathbb{R}^n$. Let $V$ be the volume and $r$ the inradius (radius of the inscribed sphere) of $\Delta^n$. There is a well-known result that $$ V \geq ...
0
votes
0answers
19 views

An Optimality Condition for the Corners of Convex Polytopes?

let $H,H'\subset\mathbb{R}^m$ be two hyperplanes with unit normal-vector and let $P\subset\mathbb{R^m}$ be a convex polytope (defined via its corners $v_0, ... , v_n$, where $n\ge m$). lets further ...
0
votes
0answers
44 views

Finding a movement taking out of a convex set

There is a convex set $S$ as the hull of M points in an D-dimensional Euclidean space and a point $\vec P$ in the set. Then, there is a set of vectors $\vec W$ taking the form $\vec W=\sum_{i=1}^N ...
4
votes
1answer
92 views

How to prove the existence of the polytope in $\mathbb{R}^d$ with a given number of faces, minimizing the isoperimetric ratio?

This is the isoperimetric type question. We know that in $\mathbb{R}^d$, balls are the sets that minimize the isoperimetric ratio $\frac{S^{d}}{V^{d-1}}$, where $S$ is the surface area and $V$ is the ...
4
votes
0answers
88 views

Prove or disprove a claim about covering a polytope by convex polytopes in a certain way

Here is the claim: Given a polytope $K$ in a unit ball in $\mathbb{R}^d$, there exists a universal constant $C(d)>0$ depending only on $d$ and a countable collection of convex polytopes ...
6
votes
4answers
97 views

Uniform Sampling Subject to Linear Equalities and Non-Negativity Constraint

I'm trying to sample uniformly on the intersections of faces of several simplicies, with all coordinates being non-negative. That is, given constraints $$A\vec{w}=\vec{b} \ \ and \ \ \vec{w} \geq ...
9
votes
2answers
261 views

Book on the tetrahedron

Does anybody know of a book containing "all you want to know about the tetrahedron"? What you want to know should include basic geometry of the tetrahedron, study of orthocentric tetrahedra, the Monge ...
5
votes
1answer
148 views

Measurement of “symmetry” of a convex body

I often hear that the regular simplex is "the least" symmetric convex body, and I've heard that there are some measures of symmetry of a body, that the simplex minimizes. Could you please explain or ...
5
votes
2answers
125 views

Differentiability of polytope shadow areas

Let $P$ be an opaque convex polyhedron containing the origin in $\mathbb{R}^3$, and let $S$ be an origin-centered sphere strictly containing $P$: $S \supset P$. For a point $x$ on $S$, let $\sigma(x)$ ...
0
votes
1answer
111 views

polynomial expression for counting number of integral points of a set

Let $v_i=a_ie_i\in\mathbb R^d$ and $w_i=b_ie_i\in\mathbb R^d$ for $i=1,\dots,d$ where $e_i$'s are unit vetcors and $a_i,b_i$ are positive integers. Let $$S=conv\{0,rv_i+sw_i:i=1,\dots,d\}.$$ Can we ...
1
vote
0answers
61 views

About properties of polynomials with common interlacing

Say $\{a_1,a_2,..,a_n\}$ and $\{b_1,b_2,...,b_n\}$ be the real roots of two monic polynomials of degree $n$ which have a common interlacing. (say I have arranged the roots in increasing order) Can ...
2
votes
1answer
41 views

Efficient algorithm for finding normals of a high dimensional convex hull with few facets

I am looking for the most efficient algorithm to use to, given a set of points in $d$ dimensional space, find the normals of the convex hull of these points, given that I know that the number of ...
4
votes
2answers
65 views

Expressing a convex Polytope as a sublevel set of a function

Given an n-dimensional polytope $P$ in $\mathbb R^n$, Given as a convex hull of a finite set of points, $S$ I would like to construct an expliict formula for a function $f\colon \mathbb R^n \to ...
2
votes
0answers
132 views

Find the intersection between two convex hulls, in this specific case

We work over $\mathbb{R}^K$. Let $V$ be the set of vectors whose coordinates take values $0$ or $1$, or equivalently the corners of the unit cube $[0,1]^K$. Let $d:\{0, \ldots, K\} \to \mathbb{R}_+$ ...
2
votes
0answers
65 views

Newton polyhedron and product of ideals

Let $I$ be an ideal generated by monomials $\underline{x}^{\underline{a}_1},\ldots ,\underline{x}^{\underline{a}_s}$ and $J$ be the ideal generated by $\underline{x}^{\underline{b}_1},\ldots ...
2
votes
2answers
223 views

Cardinality of non-integer points in the translation of the Minkowski sum of convex hull.

Let $\operatorname{conv}(a_1,\ldots,a_m)$ denote the convex hull of $\{a_1,\ldots,a_m\}$. Let $\mathbb{Z}_+=\mathbb{N}\cup\{0\}$ and $\mathbb{Q}_+$ denotes the positive (inluding 0) rational numbers. ...
1
vote
1answer
109 views

Extreme points of convex hull of Minkowski sum [closed]

Let $\operatorname{conv}(a_1,\ldots,a_m)$ denote the convex hull of $\{a_1,\ldots,a_n\}$. Let $P = \operatorname{conv}(a_1,\ldots,a_p)$ and $Q = \operatorname{conv}(b_1,\ldots,b_q)$ be two convex sets ...
1
vote
0answers
41 views

Projection of a ray onto a random polytope

Suppose $P$ is a polytope formed by $p$ (general) random planes in $\mathbb{R}^n$. We assume $p \asymp n$ and $P$ has a diameter $O(\sqrt{n})$. For any $x \in \mathbb{R}^n$, denote by ...
46
votes
5answers
2k views

Do unit quaternions at vertices of a regular 4-simplex, one being 1, generate a free group?

Choose unit quaternions $q_0, q_1, q_2, q_3, q_4$ that form the vertices of a regular 4-simplex in the quaternions. Assume $q_0 = 1$. Let the other four generate a group via quaternion ...
5
votes
1answer
146 views

Integer decomposition of dilated integral polytopes

For $n > 0$, let $P$ be an integral polytope, that is, the convex hull in $\mathbb{R}^n$ of points in $\mathbb{Z}^n$. Suppose that $\dim(P) = n$. Question: Given $d > n + 2$ is it true that $$ ...
3
votes
1answer
158 views

Computionally efficient vertex enumeration for (convex) polytopes

Let $P \subseteq \mathbb{R}^d$ be an $\mathcal{H}$-polytope. The vertex enumeration problem asks for the set of vertices $V$ of $P$. Theoretically, the vertex enumeration problem for $P$ can be ...
4
votes
1answer
69 views

Largest regular $k$-simplex inscribed in a $d$-cube, $k < d$

The largest (by edge length) regular simplex inscribed in a unit cube is well known in $\mathbb{R}^2$ and $\mathbb{R}^3$:     Image sources: left: NMSU, right: Mathworld. A recent ...
7
votes
2answers
188 views

Decomposition of a cross-polytope into simplices

Consider the standard embedded $n$-cross polytope $P_n$ with vertices $\pm e_i \in \mathbb R^n$. Let us consider decompositions of this polytope into $2^{n-1}$ simplices, such that these simplices ...
1
vote
1answer
72 views

4D Duoprisms based on nonconvex polygons

A duoprism is a polytope that can be expressed as the Cartesian product of two polytopes (each of dimension $\ge 2$). Four-dimensional duoprisms in particular have been studied: $$P \times Q = \{ ...
13
votes
2answers
266 views

Can any simplex shadow-project to a regular simplex?

Every triangle $A$ can be oriented in $\mathbb{R}^3$ so that its orthogonal projection (shadow) onto the $xy$-plane is an equilateral triangle $Q$:               ...
17
votes
5answers
418 views

How many unit simplices are needed to cover a unit $n$-cube?

The volume of an $n$-dimensional simplex of unit edge length is $$V(n) = \frac{\sqrt{n+1}}{n! 2^{n/2}} \;,$$ so at least $\lceil 1/V(n) \rceil$ such simplices are needed to cover the unit $n$-cube. ...
3
votes
0answers
88 views

Intersection numbers on blow ups of toric varieties

Suppose we have a smooth, complete toric varietiy $X_{\Sigma}$ of dimension $n$. Let $\sigma_k \in \Sigma(k)$ a smooth $k$-dimensional cone in $\Sigma$ and suppose we make the toric blow up at the ...
3
votes
1answer
126 views

convex decompositions of the sphere

Consider a decomposition of the sphere $S^n$ into convex pieces (that is, every cell of the cell decomposition is convex, in particular, is contained in a hemisphere). Consider the $k$-skeleta of ...
3
votes
0answers
83 views

Polytopes whose intersections have few vertices

This is related to one that I asked earlier: The intersection of two $l_1$ balls My question: are there any general classes of polytopes $P_1,P_2\subset\mathbb{R}^n$ such that $P_1$ has few ...
2
votes
0answers
90 views

The intersection of two $l_1$ balls

Let $B_1$ and $B_2$ be two balls in $\mathbb{R}^n$ with respect to the $l_1$ norm that have different radii and different centers. Is there an upper bound for the number of vertices that $B_1\cap ...
1
vote
0answers
31 views

Volume under the intersection of scaled simplices

This is rather specific but I need to compute the volume under the intersection of rescaled simplexes, that is, the volume of the space: $\left\{x \in \mathbb{R}^n|\sum_i c_{ki} |x_i| \leq1\; k = 1 ...
3
votes
2answers
89 views

algorithm of polytope

Basically, we have an incremental sets of vertices $${V_1} \subset {V_2} \subset ...$$ for each of them, we could build a polytope $${P_i} = Conv({V_i})$$ Consequently, we can compute $${F_i} = ...
1
vote
0answers
72 views

A version of isotone projection cones

We write $a \succeq b$, where both $a, b \in \mathbb{R}^n$, as a shorthand for $a_i \ge b_i$ for all $1 \le i \le n$. Let $C$ be a closed convex cone in the first orthant of $\mathbb{R}^n$ and denote ...
2
votes
0answers
56 views

A convex analysis theorem improvement

John's theorem states that to any full-dimensional symmetric convex set $K\subseteq R^n$ and any Ellipsoid $E\subseteq R^n$ that is centered at origin, there exists an invertible linear map $T$ so ...
3
votes
0answers
71 views

Does a polytope have a self-indexing shelling?

If $X$ is a smooth projective toric variety and $P \subset \mathbf{R}^n$ is its moment polytope, then a generic linear function on $\mathbf{R}^n$ induces (1) a Morse function on $X$, and (2) a ...
1
vote
1answer
115 views

Computation of extreme rays of rational polyhedral cones - Hemmecke's project and lift algorithm

I am working on an implementation of Raymond Hemmecke's algorithm for finding generating sets of cones: http://arxiv.org/abs/math/0203105 Unfortunately I am struggling to make the algorithm work on ...
1
vote
1answer
45 views

number of affine pieces of linear interpolation of convex functions in high dimension

Consider a convex function $f$ defined on a $d$-dimensional hypercube $[0,1]^d$. Now for fixed $m \in \mathbb{N}$, consider the grids $\mathcal{G}_m=\{(i_1/m,\cdots,i_d/m)\}$ where ...