The tag has no usage guidance.

learn more… | top users | synonyms

14
votes
1answer
365 views

On convergence of convex bodies

Let $K\subset \mathbb{R}^n$ be a compact convex set of full dimension. Assume that $0\in \partial K$. Question 1. Is it true that there exists $\varepsilon_0>0$ such that for any ...
1
vote
0answers
19 views

Is support function of a convex curve in $\mathbb{R}^2$ absolutely continuous? [on hold]

There is an example of a convex function of two variables that is convex but not absolutely continuous. The level set of this function is a convex curve. To construct one example of such a function ...
1
vote
0answers
21 views

Upper bound on the number of convex connected components of the complement of the zero set of a polynomial

The classic Milnor-Thom upper bound on the sum of the Betti numbers of real algebraic sets (for a nice exposition and references, see e.g. N.R. Wallach, On a Theorem of Milnor and Thom, in S. Gindikin ...
17
votes
5answers
2k views

How to explain the concentration-of-measure phenomenon intuitively?

One way to phrase the "concentration-of-measure" phenomenon is that, for a Euclidean sphere $S^d$ in $d$ dimensions, for large $d$, "most of the mass is close to the equator, for any equator."1 ...
1
vote
2answers
40 views

Can we prove that a normal surface of an extreme point of a convex subset of a simplex is a separating hyperplane?

Let's assume that we have a simplex $G = \{x\in R^d|\sum_{i=1}^d x_i=1, x_i\ge 0 , i = 1, 2, .., d\}$ and a polyhedral convex subset $H \subseteq G$. Is it possible to prove that for any extremal ...
4
votes
1answer
161 views

Ascertain properties of a new kind of rectilinear-convex set

PREABMLE TO MY QUESTION I am reading about convex sets and hulls in orthogonal/rectilinear spaces. As can be seen in this publication, for a given set of points in $\mathbb{R}^{2}$, there are many ...
8
votes
1answer
189 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$. ...
11
votes
1answer
282 views

Choquet theory and Hilbert's fourth problem

The following text is an attempt to see Hilbert's fourth problem in a new light. Definition. A pseudometric $d$ on $\mathbb{R}^n$ is called projective if whenever a point $z$ belongs to a line ...
4
votes
1answer
158 views

Atiyah-Guillemin-Sternberg convexity theorem

I would like to study the Atiyah-Guillemin-Sternberg convexity theorem: proof and applications. I am already familiarised with hamiltonian actions, moment maps...and with elementary Morse theory. So ...
1
vote
1answer
188 views

does every compact convex set in c0 have but countably many extreme points

This seems plausible, given the properties of the unit ball of $c_0$. I have a compact set in a complex Banach space $X$ whose closed convex hull has uncountably many extreme points. It would be ...
3
votes
1answer
149 views

A lottery on coins in a convex set

You play the following game. You get $4n$ gold coins and have to arrange them in the unit square in general position (no two coins have the same x or the same y coordinate). Call this set of coins ...
28
votes
2answers
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 ...
3
votes
1answer
367 views

A min-max formula for depth of the origin in a convex set

Depth is defined as the distance to the boundary of a set, i.e., $\operatorname{depth}(x, C) = \operatorname{dist}(x, \mathbb{R}^n \backslash C)$. Let $C$ be a convex set that contains the origin. I ...
4
votes
2answers
102 views

Cluster Variables for non-convex n-gons

Most of the lectures and lecture notes on Cluster Algebras (at least from Combinatorial point of view) start with mutations of the diagonals of a convex n-gon (mostly the pentagon) as the illustration ...
22
votes
3answers
2k views

Research trends in geometry of numbers?

Geometry of numbers was initiated by Hermann Minkowski roughly a hundred years ago. At its heart is the relation between lattices (the group, not the poset) and convex bodies. One of its fundamental ...
3
votes
1answer
120 views

The center of a minimal convex superbody

Is the following true? CONJECTURE: $\,$ Let $\ B\ C\subseteq\mathbb R^n\ $ be convex bodies in $\mathbb R^n$ such that $\ C\ $ is centrally symmetric, $\ B\subseteq C,\ $ and $\ t\!\cdot\! B\ $ ...
1
vote
0answers
38 views

Projecting on a convex compact polytope with special form

Let $E$ be a large sparse $l$-by-$n$ matrix ($l$ and $n$ can be in the billions...) with coefficients in $\{-1, 0, 1\}$: the first row of $E$ is the vector $(1,0,0,\ldots,0) \in \mathbb R^n$, and ...
1
vote
0answers
68 views

Projecting on a a special polyhedron

Let $X$ be an $n$-by-$p$ matrix and consider the closed convex polyhedron $$\mathcal P_X := \{y \in \mathbb R^n | \|X^Ty\|_\infty \le 1\}.$$ Notice that $\mathcal P_X$ is symmetric about the origin. ...
51
votes
2answers
822 views

Continuous maps which send intervals of $\mathbb{R}$ to convex subsets of $\mathbb{R}^2$

Let $f : \mathbb{R} \longrightarrow \mathbb{R}^2$ be a continuous map which sends any interval $I \subseteq \mathbb{R}$ to a convex subset $f(I)$ of $\mathbb{R}^2$. Is it true that there must be a ...
2
votes
4answers
107 views

Show that the Minkowski sum of two triangles in 3D is the union of Minkowski sums of each triangle along the other's edges?

I'd like to show (or disprove) the claim that the Minkowski sum of two triangles with vertices in $\mathbb{R}^3$, $A+B$, is equal to the union of the unions of the Minkowski sums of $A$ along all ...
11
votes
1answer
293 views

Minimize sum of $\ell_2$ norm and linear combination, on simplex

Let $\Delta_n := \{x \in \mathbb{R}^n | x \ge 0, \sum_{1 \le i \le n}x_i = 1\}$ be the $n$-simplex. For $a, b \in \mathbb R^n$, with $\Delta_n \not \ni a$, consider the problem of computing the ...
1
vote
0answers
36 views

Checking integer points of given infinity norm on intersection

If we have convex region $\mathscr R$ given as intersection of a convex polytope $\mathscr P$ and an ellisoid $\mathscr E$ in $\ell^2$ norm is there an efficient way to test if there is an integer ...
4
votes
1answer
184 views

Questions about the regularity of the “norm” associated to a convex set

Suppose $K\subset \mathbb{R} ^n$ is a closed convex set whose interior contains the origin. We can assign a gauge function to $K$ as $g_{K}(x):=\inf\{\lambda>0 \mid x\in\lambda K\}$. $g_K$ has all ...
6
votes
0answers
53 views

Convex hull of the orbit of a matrix under permutations

Let $P$ be a generic permutation matrix on $\mathbb{R}^n$. For any vector $x \in \mathbb{R}^n$, the convex hull of the set $\{ Px : \; \text{$P$ is a permutation matrix}\}$ is the set of vectors ...
7
votes
1answer
233 views

Is the center of gravity in a CAT(0) space contained in the convex hull?

In reading Greg Kuperberg's partial answer to this question Convex hull in CAT(0) , I started wondering if the center of gravity is always contained in the closed convex hull. More precisely, given ...
5
votes
0answers
68 views

What is the maximal convex hull in $\mathbb R^3$ of a tree with fixed total length?

Denote by $\mathcal T_n$ the set of all trees on $n$ nodes. For a tree $T\in\mathcal T_n$, we assign to each edge a non-negative length such that the sum of all lengths is 1. Denote by $v(T)$ the ...
0
votes
0answers
23 views

Efficient sampling from a polytope with large number of contraints [duplicate]

As far as I know, the most popular way to sample from a polytope (in H-representation) \begin{equation} \mathcal{P} := \{z \in \mathbb{R}^n | (Az)_j \le b_j\; \forall j=1,2,\ldots,m\} \end{equation} ...
1
vote
0answers
42 views

Number of simplices contained in a convex body

I am interested in the following question: Given a convex body $K$ in $\mathbb{R}^d$ and an $\epsilon>0$ small enough, how many $d$-simplices $\{D_i\}_{i=1}^m\subset K$ do we need at least so that ...
13
votes
0answers
236 views

A functional inequality about log-concave functions

Let $f,g$ be smooth even log-concave functions on $\mathbb{R}^{n}$, i.e.,$f=e^{-F(x)}, g=e^{-G(x)}$ for some even convex functions $F(x),G(x)$. Is it true that: $$ \int_{\mathbb{R}^{n}} \langle ...
5
votes
1answer
764 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 ...
0
votes
0answers
60 views

Maximum value of linear function on the intersection of a parametrized family of balls

Let $C$ be a (nonempty) closed convex subset of $\mathbb{R}^n$ and $a, b \in \mathbb{R}^n$. Using the normal cone characterization of the euclidean projection operator $\mathrm{proj}_C$ (recall that ...
2
votes
1answer
73 views

Internal edges in Convex Polytopes

Suppose $S\subset{\mathbb R}^n$ is an infinite subset that is in general position which means that the intersection of $S$ with every affine subspace of dimension $d<n$ always contains at most ...
7
votes
1answer
140 views

Regions on a sphere that avoid a fixed point set

Let $P$ be a finite set of points on a unit-radius sphere $S$ in $\mathbb{R}^3$. Treat $P$ as a fixed pattern that can be rigidly slid around $S$ as a unit (no reflection). Let $R$ be a subset of ...
4
votes
0answers
103 views

Alexandrov-Fenchel inequality for sets of positive reach

If $E$ is a convex subset of $\mathbb{R}^n$ with $|E| = |B_1|$, then one consequence of the classical Alexandrov-Fenchel inequalities from convex geometry is that $$\int_{\partial E} H_{\partial E} ...
2
votes
1answer
234 views

Homotopy with non piece-wise linear boundary

in the middle of a long proof I encounter the following problem. Let $E$ be a closed and convex set in $\mathbb R^n$ such that for all $\vec x\in E$ it holds that $\sum_ix_i=1$. (We can understand ...
1
vote
0answers
62 views

Affine-regular hexagon in convex body

An affine-regular $n$-gon is a non-degenerate affine image of the regular $n$-gon. It seems to be a standard fact in combinatorial geometry that inside every convex compact set $K\subseteq \mathbb ...
1
vote
0answers
44 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
84 views

Diameter of a convex body relative to its Legendre ellipsoid

Given a convex body in $\mathbb{R}^n$ that is symmetric with respect to the origin, let us measure its diameter with respect to the Euclidean metric determined by its own Legendre ellipsoid. How large ...
0
votes
0answers
45 views

A question about the approximation of convex cones

I have the following question which maybe is too naive. Let $K$ be a convex cone on $\mathbf{R}^n$. Can we approximate $K$ by a sequence of polyhedral convex cone $K_i$ such that for any compactly ...
4
votes
0answers
181 views

Osculating ellipsoids

Let $K$ be a given smooth, origin-symmetric, strictly convex body in $n$ dimensional euclidean space. At every point $x$ on the boundary of $K$ there exists an origin-symmetric ellipsoid $E_x$ that ...
0
votes
1answer
114 views

Convex cones: strict separation

Consider two closed convex cones $A$ and $B$ in $\mathbb{R}^3$. Assume that they are convex even without zero vector, i.e. $A \setminus \{0\}$ and $B \setminus \{0\}$ are also convex (it helps to ...
3
votes
1answer
129 views

A family of convex bodies in Banach-Mazur position

Let $\{K_i\}$ be a family of smooth, origin-symmetric, strictly convex bodies such that $K_i$ converge in the Hausdorff distance (or you may assume $\partial K_i\to \partial K$ smoothly, in the sense ...
7
votes
0answers
114 views

Bang's open question strengthening Tarski's planks problem

Tarski's Planks problem, solved by Thøger Bang in 1951, says (in a simplified $\mathbb{R}^2$ version) that it requires "planks" (parallel strips) of total width $\ge d$ in order to completely cover a ...
6
votes
1answer
184 views

Hilbert metric and cross-ratio of points on simplices

Background and motivation: Consider the cone $C\subset \mathbb{R}^d$ of vectors with non-negative components, and let $\Delta\subset C$ be the simplex of probability vectors (those for which $\sum ...
5
votes
1answer
71 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 ...
2
votes
1answer
111 views

Set of regular points in an Alexandrov space with curvature bounded below

Let $X^n$ be an $n$-dimensional Alexandrov space with curvature bounded below. A point $x\in X$ is called regular if the space of directions $\Sigma_x$ is isometric to the standard sphere $S^{n-1}$. ...
3
votes
1answer
156 views

Matching moments in even dimensions

Let $D$ be a probability distribution on the unit interval $[0,1]$ with moments $\mu_i=\mathbb{E}_D [x^i]$. Let $\delta(x)$ be a singleton probability distribution with all weight at $x\in [0,1]$. ...
18
votes
5answers
873 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 ...
2
votes
2answers
232 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
0answers
54 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 ...