**0**

votes

**1**answer

35 views

### Mapping n variables to the surface of an n+1-dimensional cross polytope [on hold]

I'm looking for a function that maps n variables to points on the surface of an n+1-dimensional cross polytope. For example, given one variable, the function would return a point on the perimeter of ...

**-2**

votes

**2**answers

68 views

### Maximal-Orthogonal Convex Hull (or Maximal-Rectilinear Convex Hull) [closed]

Edit : Consider giving a reason for down vote.
In my research, I have come across a this paper from the Computational Geometry field and I am not able to understand the concept of ...

**2**

votes

**0**answers

43 views

### Testing if a point is inside a convex polytope formed by halfspaces in n-dimension

Assume we have a convex polytope that is formed by the intersection of $k$-halfspaces in $\mathbb{R}^{n}$.
$$
a_{0,0}x^{n-1} + {a}_{0,1}x^{n-2} + ... a_{0,n-1} \leq 0
$$
$$
a_{1,0}x^{n-1} + ...

**5**

votes

**1**answer

147 views

### “Database” of simplicial polytopes/spheres

Reading through various papers on polytopes I have come across really interesting examples of simplical polytopes and non-shellable (or non-PL) simplicial spheres but sometimes it is hard to keep ...

**1**

vote

**0**answers

52 views

### About optimizing a convex function on a hypercube

Given a real valued convex function $g$ on $[-1,1]^n$, let $f$ be the restriction of it on the hypercube $\{-1,1\}^n$. I want to find a vertex on the hypercube $\{-1,1\}^n$ on which either (1) $f$ ...

**2**

votes

**0**answers

31 views

### Is every 1-skeleton of a 4-tope Steinitzian?

Call a graph "polyhedral" if it is simple, planar, and 3-connected. For example, the 1-dimensional skeleton of every 3-dimensional convex polytope, regarded as a graph, is polyhedral. By a theoreom ...

**3**

votes

**0**answers

34 views

### “Spherelike” embedding for smooth Fano polytope

Let $\mathbb{R}^n$ be a vector space with Euclidean inner product and $\mathbb{Z}^n \subset \mathbb{R}^n$ be a lattice. Let $P$ be a full dimension convex lattice polytope in $\mathbb{R}^n$ containing ...

**5**

votes

**1**answer

64 views

### Volume satisfying inequality constraints (simplex subset)

Is there a way to find the volume of the "feasible region" of a standard simplex satisfying simple range constraints?
$x_1+x_2+...+x_n = 1$
$a_1 \le x_1 \le b_1$
$a_2 \le x_2 \le b_2$
$...$
$a_n \le ...

**1**

vote

**1**answer

64 views

### approximate diameter of polytopes in high dimensions

I just came across the following problem:
Let us consider the unit corner of the n-cube
$$
\Delta^n = \left\{(t_1,\cdots,t_n)\in\mathbb{R}^n\mid\sum_{i = 1}^{n}{t_i} \leq 1 \mbox{ and } t_i \ge 0 ...

**9**

votes

**2**answers

102 views

### Generate polyhedra by collapsing vertices of a polyhedron

I am looking for basic information about the following idea:
(I) Consider a square. By collapsing two adjacent vertices, we obtain a triangle.
(II) Consider a three-dimensional cube. By collapsing a ...

**1**

vote

**0**answers

55 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

**0**answers

77 views

### Properties of Coefficients of Order Polynomials [closed]

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

**1**answer

59 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})$ ...

**5**

votes

**0**answers

53 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

**0**answers

88 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

**2**answers

92 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

**0**answers

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

**1**answer

150 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

**0**answers

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

**5**

votes

**2**answers

92 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

**0**answers

29 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

**1**answer

143 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

**0**answers

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

**1**

vote

**0**answers

31 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$).
Let's ...

**0**

votes

**0**answers

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

**5**

votes

**1**answer

95 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

**0**answers

89 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

**4**answers

101 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

**2**answers

274 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

**1**answer

155 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

**2**answers

129 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

**1**answer

112 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

**0**answers

68 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

**1**answer

42 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

**2**answers

66 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

**0**answers

134 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

**0**answers

69 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

**2**answers

227 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

**1**answer

129 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

**0**answers

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

**47**

votes

**5**answers

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

**1**answer

162 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

**1**answer

190 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

**1**answer

81 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

**2**answers

192 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

**1**answer

78 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

**2**answers

270 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

**5**answers

426 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

**0**answers

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

**1**answer

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