# Tagged Questions

**-1**

votes

**0**answers

47 views

### How to prove that the vertices of a convex hull are only defined by some specific subsets, in this particular case [on hold]

Let $\mathbb{V}$ a vector space of dimension $2^N$, where each vector (of size $N$) is a combination of $0$ and $1$. ex: for $N=2$, $\mathbb{V}$={[0 0],[1 0],[0 1],[1 1]}.
Consider (in ...

**13**

votes

**4**answers

375 views

### The limit of edge-midpoint convex polyhedra

Starting with a convex polyhedron $P_1 \subset \mathbb{R}^3$,
replace that with $P_2$, the convex hull of the midpoints of the edges of $P_1$.
Continuing this process, we obtain a ...

**4**

votes

**2**answers

221 views

### Convex Sets and Nearest Neighbors

For a set $S \subseteq \mathbb{R}^n$ and a point $x \in \mathbb{R}^n$, let $c_S(x)$ be the point $s \in S$ that minimizes $\|x-s\|$ if such a point exists and is uniquely determined. It is known that ...

**3**

votes

**0**answers

52 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

**1**answer

98 views

### $\mathcal{H}$-polyhedron under a linear map

Let $P = \{ x \in \mathbb{R}^n \mid Ax \leq b \}$ be a (bounded) polyhedron for $A \in \mathbb{R}^{m \times n}$ and $b \in \mathbb{R}^m$, $n,m > 0$.
Moreover, let $M \colon \mathbb{R}^n \to ...

**2**

votes

**0**answers

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

**1**

vote

**2**answers

104 views

### Volume of normal cone of a simplex (at a vertex)

This question is related to an orthant-type simplex in $\mathbb{R}^n$, which can be defined as
$$ S = \{x\in\mathbb{R}_{+}^n: \sum_{i=1}^nx_i \leq 1\}=\overline{\mbox{conv}}(0,e_1,\ldots,e_n). $$
For ...

**2**

votes

**1**answer

127 views

### intersection of the unit cube and a hyperplane containing the main diagonal

Let $A$ be a linear $m$-dimensional subspace of $\mathbf{R}^n$ $m < n$, containing the point $(1,1,\ldots,1) \in \mathbf{R}^n$,
and consider the intersection of $A$ and the unit cube $\Delta_n$ ...

**3**

votes

**0**answers

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

**4**

votes

**1**answer

111 views

### The number of facets of a polyhedron under linear transformation

Consider a (not necessarily bounded) convex polyhedron $P\subset \mathbb{R}^n$ which has $k$ facets.
Let $L:\mathbb{R}^n \to \mathbb{R}^m$ be a linear transformation.
Question1: Is there a fixed ...

**5**

votes

**1**answer

320 views

### Linear transformation of a polyhedron

Is there a simple proof that shows:
Linear transformation of a $\mathcal{H}$-polyhedron (i.e. the intersection of
finitely many closed half-spaces) is a $\mathcal{H}$-polyhedron.
Minkowski sum of ...

**2**

votes

**1**answer

75 views

### Volume of a polytope with relaxed constraints

Consider a polytope in $n$ dimensions defined by a set of linear constraints:
$$P = \{x \in \mathbb{R}^n : Ax \leq b\}$$
where A is some $m \times n$ constraint matrix, and $b = (b_1,\ldots,b_m)$ is ...

**8**

votes

**1**answer

182 views

### Status of Barany's conjecture?

One of Barany's most intriguing conjectures is about the $f$-vectors of convex polytopes. It asks:
Let $P$ be a convex $d$-polytope. Is it always true that $f_k \geq \min(f_0, f_{d-1})$?
A ...

**13**

votes

**0**answers

345 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?

**3**

votes

**0**answers

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

**0**

votes

**0**answers

81 views

### additive support functions of a convex set

Let $K \subset \mathbb{R}^d$ be a compact, convex set. It could be uniquely determined by its support function (for $u$ on the unit-sphere $S^{d-1}$), given by
$$h_K(u) = \sup \{ \sum_{i=1}^d x_i ...

**21**

votes

**4**answers

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

**6**

votes

**0**answers

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

**2**

votes

**1**answer

146 views

### Approximation of a convex body by a contained polytope

This question deals with approximating a convex body (a compact convex set of $\mathbb{R}^d$ with non-empty interior) by convex polytopes.
For a given $\delta$, let $n_\delta$ be the number of faces ...

**6**

votes

**1**answer

101 views

### Maximizing ratio volume/diameter^n by an affinity

Suppose we have a convex compact body $D\subset \mathbb R^n$. We can try to apply affine transformation keeping the volume and decreasing the diameter of $D$.
It is clear that there is a constant ...

**1**

vote

**1**answer

110 views

### 2-neighborhood of a simplex

Let $\Delta$ be an $n-1$-simplex in ${\mathbb R}^{n-1}$. For each vertex $v$ of $\Delta$ let $H_v$ be the hyperplane through $v$ and parallel to the opposite facet. By 2-neighborhood of a simplex I ...

**7**

votes

**0**answers

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

**4**

votes

**0**answers

172 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} = ...

**1**

vote

**0**answers

84 views

### Distance function from the origin to the boundary of a convex polytope

Let $K\subseteq \mathbb R^n$, $n\ge 3$ be a convex bounded polytope containing the origin in its interior. Consider the unit sphere with geodesic distance $(\mathcal S^{n-1},d)$ and define the ...

**4**

votes

**1**answer

196 views

### n-simplex in an intersection of n balls

Consider any $n$-simplex, $n \geq 2$. For each edge $(i,j)$, consider $n$-ball $B_{ij}$ such that vertices $x_i$ and $x_j$ are antipodal on this ball. Fix a point $x_0$ in the simplex. The question: ...

**1**

vote

**3**answers

142 views

### How to determine if two rational cones intersect?

Let $$\displaystyle C_1=C(r_1,...,r_{n_1})=( x\in \mathbb{R^d}|x=\sum_{i=1}^{n_1}\lambda_i r_i, \lambda_i\in \mathbb{R_{>0}})$$
$$\displaystyle C_2=C(t_1,...,t_{n_2})=(x\in ...

**5**

votes

**2**answers

240 views

### Diameter-area ratio for affine tranformations.

Consider an convex plane figure $F$. How to prove that there is an affine transformation $a$ such that $\sqrt{3}$ diameter$(a(F))^2\leq 4$ area$(a(F))$?
I found only one reference, to "Ãœber einige ...

**0**

votes

**2**answers

236 views

### Higher dimensional convex hull

Let $CH(S)$ be a convex hull of a finite set $S$ and denote the set of all the vertices of $CH(S)$ as $Vert(S)$. For a vertex $v \in Vert(S)$, it has an associated set $E(v)$ which is defined as ...

**1**

vote

**1**answer

216 views

### non-convex Polytope definition

I have a simple question. I read that given a vector space $N_{\mathbb{R}}$ over $\mathbb{R}$,
we can define a convex polytope in the following way:
$$P:= \Big\{ \sum_{u\in S} \mu_u u \,\Big| \, ...

**3**

votes

**0**answers

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

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

**19**

votes

**4**answers

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

**0**

votes

**0**answers

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

**2**

votes

**1**answer

371 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

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

**5**

votes

**1**answer

327 views

### Isometric embedding a convex cap to render its boundary planar

I would like to know if there is a polyhedral analog to this beautiful
theorem of Hong:
Theorem 11.0.1.
Any smooth positive disk $(\bar{D},g)$ with a positive geodesic
curvature along ...

**0**

votes

**0**answers

331 views

### Upper and Lower Bounds of the Total Surface Area of Convex Polytopes that Partition a Hypercube

Let $C$ be a hypercube in $\mathbb{R}^D$ with edge length of $L$. Let $\mathcal{P}_1,\ldots,\mathcal{P}_K$ be $K$ convex polytopes that partition $C$. Let $S_k$ be the surface area of the polytope ...

**1**

vote

**2**answers

434 views

### Extreme points of transportation polytope

I'm interested in $n \times m$ joint probability tables with prescribed row and column marginals. Such tables form a convex set known as the transportation polytope. What are the extreme points of ...

**2**

votes

**2**answers

477 views

### Finding smallest ellipsoid that circumscribes over intersection of two ellipsoids that do not have common center

Does this already exist in literature? The closest Ive been able to find is circumscribe intersection of two ellipsoids with a common center by W. Kahan ...

**2**

votes

**1**answer

286 views

### Angle btween Coordinate Vector and Normal Vector of Facet in a Convex Polytope, Asking for a Counterexample

Definitions
Let $\mathcal{C}$ be a convex polytope in $\mathbb{R}^{D}$ with $K$-facets
$F_{1},\ldots,F_{K}$. I denote the normal vector of the $k^\mathrm{th}$ facet as
...

**12**

votes

**1**answer

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

**13**

votes

**3**answers

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

**3**

votes

**0**answers

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

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

**8**

votes

**3**answers

1k views

### Listing lattice points in a simplex

Let $n \in \mathbf{Z}_{\geq 1}$. Is there an algorithm which, given a simplex $\Delta \subset \mathbf{R}^n$ specified as the convex hull of $v_0,\dots,v_n \in \mathbf{Z}^n$, computes the set $\Delta ...

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

**8**

votes

**1**answer

192 views

### Finding a point that lies in a majority of polytopes

Suppose I have $k$ $n$-dimensional polytopes $P_1,\ldots,P_k$, each explicitly specified as the intersection of a collection of hyperplanes. If there was a point $p \in \mathbb{R}^n$ that lay in the ...

**0**

votes

**3**answers

525 views

### a different algebra/representation for convex sets

Hi,
I was dealing with finding a feasible region for a set of norm inequalities and the feasible region is convex. The question is not about how to find the feasible region but how to represent the ...

**11**

votes

**5**answers

738 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$, ...