0
votes
0answers
19 views

Intuitive affirmation on convex sets

Let $D_1, D_2$ two open, bounded and convex domain in $R^n$. Suppose that $D_2 \supset \overline{D_1}$, and the boundaries of these sets are of class $C^1$. Fix $x \in \partial D_1$ and suppose that ...
17
votes
2answers
312 views

Convex surface on which any two points $a,b$ can be joined by a curve of length $(\pi/2-\epsilon)|a-b|$

I am trying to solve an exercise on page 13 of the book Metric structures on Riemannian and non-Riemannian spaces by Gromov. Construct a closed, convex surface $X$ in $\mathbb R^3$ such that any ...
0
votes
0answers
37 views

proof of the existence of spherical sections of ellipsoids

i want to prove : Let L be proper ellipsoid with the origin as center in $E^{2m-1}$ .There exists a subspace $E^m$ such that $E^m$ intersects $L$ is an m-dimensional sphere it is proven by Dvoretzky ...
0
votes
1answer
27 views

Why is it a borel set on the boundary of the unit ball of $E^n$?

Given $C$ convex body (compact convex set with non-empty interior points) in $E^n$ symmetric about the origin and containing the unit ball. Let $A(r)$ denote ,for every real $r >1$, the subset of ...
1
vote
1answer
40 views

what is the meaning of asphericity of convex set in a linear normed space?

I am trying to understand the definition of spherical to within $\epsilon$ for a convex body in a linear normed space, as given in Aryeh Dvoretzky's paper [1] (section 2, page 203): A convex set ...
6
votes
1answer
66 views

Name of a shape that is intersected once by each ray that starts at a given point

Is there a particular name for a shape that is intersected exactly once by each ray that starts at a given point? To illustrate: I'm looking for a name for shapes like the left one in this image: ...
1
vote
1answer
36 views

Show that the ellipse and the hyperbola are convex

In Spivak's chapter on differentiation, he asks the reader to prove that the tangent line to an ellipse or a hyperbola intersect the figure at exactly one point. How is this done most elegantly? I ...
-1
votes
1answer
39 views

If we inscribed all the 6 regular convex four-dimensional polytopes in a sphere, which one would have the highest volume?

When a dodecahedron is inscribed in a sphere, it occupies more of the sphere's volume (66.49%) than an icosahedron inscribed in the same sphere (60.54%). But what about for the 6 regular convex ...
0
votes
0answers
28 views

What are the formulas for the number of vertices, edges, faces, cells, 4-faces, …, $n$-faces, of convex regular polytopes in $n \geq 5$ dimensions?

I know that in dimension $n \geq 5$ there are only 3 kind of convex regular polytopes in each dimension: the $n$-simplex, the $n$-cube and the $n$-orthoplex. I would like to know if there are ...
0
votes
0answers
16 views

Adjacency of convex hull facets

Let $C$ be a $d$-dimensional convex polytope and $p$ is a point outside of it. $C=\{f_c\}$ defined by set of facets $f_c=\{p_c,A_c\}$ where $p_c$ is a tuple of vertices and $A_c$ is a set of ...
0
votes
0answers
21 views

Detecting faces of polytopes

I am working in convex geometry for the summer with little experience beforehand. It's a lot of fun but it does mean I don't know some of the basic things. I'm interested in the orbits of finite ...
0
votes
0answers
18 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 ...
0
votes
1answer
35 views

Separate two convex sets with disjoint interior (in $\mathbb{R}^n$)

In $\mathbb{R}^n$, I know that if $A$ is a convex set and $b$ in the boundary of $A$. Then we can separate $A$ and $b$, which means there exists $f \in \mathbb{R}^n$ such that $f\cdot x \ge f \cdot b$ ...
0
votes
0answers
21 views

Polar set and adjoint operator

I'm trying to understand the following statement: A bounded operator between Banach spaces $u:X\rightarrow Y$ satisfies: $$\textrm{inf}\{\;||u(B_X \cap S)||:S\subset X,\,\textrm{codim}S=k \; ...
3
votes
0answers
54 views

What is the smallest possible angle of this polygon?

A convex polygon contains a square with side-length 1 and is contained in a parallel square with side-length 2. What is the smallest possible angle of the polygon? What is its smallest possible area? ...
0
votes
1answer
33 views

What is the shape of all convex combinations of $\geq$ five vectors in $\mathbb{R}^3$?

The convex combinations of two linearly independent vectors in $\mathbb{R}^3$ span a line. The convex combinations of three linearly independent vectors in $\mathbb{R}^3$ span a solid triangle. The ...
3
votes
0answers
50 views

Is it always possible to partition a fat shape to fat shapes?

The slimness factor of a geometric 2-dimensional shape is defined (for this question) as the ratio of the side-length of its smallest enclosing square to the side-length of its largest enclosed ...
1
vote
0answers
40 views

property of Convex body on the plane

Let $K$ be a convex body on the plane with smooth curve. Observe the triangle $\triangle ABC$ that contains $K$ with minimal perimiter and let $X,Y,Z$ the points on $BC,AC,AB$ that belong to $K$. I ...
0
votes
1answer
207 views

convex hull function in matlab

Is there anyway to compute the convex hull of a finite set of points in Matlab and gives the half-space representation as its result? I usually use a toolbox called MPT developed at ETHZ Zurich, but ...
1
vote
1answer
65 views

How to use Markov-Kakutani fixed point theorem to show that abelian groups are amenable?

Recall that a group $\Gamma$ is amenable if there exists a state $\mu$ on $l^{\infty}(\Gamma)$ which is invariant under the left translation action: for all $s\in \Gamma$ and $f\in ...
1
vote
3answers
82 views

Is convex hull of a finite set of points in $\mathbb R^2$ closed?

Is the convex hull of a finite set of points in $\mathbb R^2$ closed? Intuitively, yes. But not sure how to show that. Thanks!
2
votes
1answer
82 views

Relation between mean width and diameter

Question: Let $A$ be a compact set in $\mathbb R^n$. Is it always true that $\text{mean-width}(A) \ge C \cdot \text{diam}(A)$ for some constant $C$ depending only on the dimension? If not, is it ...
0
votes
1answer
19 views

How do I justify that a second order cone is an intersection of half space

I am studying convex optimization right now, and the text book claims that a second order cone is a collection of intersections of half space $$K_n = \bigcap_{ u:\|u\|_2 \leq 1} \{(x,y) \in R^{n+1 } ...
1
vote
1answer
40 views

Convex Sets and extreme supports

Let the set $S$ in $R^n$ consists of the origin $0$ and $n$ lineary independent vectors $T_1, \ldots, T_n$. Show that $C(S)$, the convex hull of of $S$, is the intersection of its extreme supports, ...
0
votes
1answer
42 views

Volume of unit n-dimensional ball, definite integal

As a part of an assignment to calculate the volume of unit n-dimensional ball I got to the following expression, which I believe is true: ...
2
votes
1answer
37 views

Distance of convex combination of pairs of points in $\mathbb{R}^n$

Given 4 points $w,x,y,z \in \mathbb{R}^n$ define for $t\in [0,1]$ $f(t)=d(wt + (1-t)x, yt + (1-t)z)$. Is this function convex? I have found a proof by differentiating twice and calculating a lot but ...
0
votes
0answers
21 views

Folding in $\mathbb{R}^2$ - which area of modern geometry formalises this concept?

For any lines $L_1,...,L_n$ in $\mathbb{R}^2$ and $w_1,...,w_n \in \{-1,+1\}$ we can define a folding operation $F(L_1,...,L_n; w_1,...,w_n): \mathscr{P}(\mathbb{R}^2) \rightarrow \mathbb{R}^2$, ...
3
votes
1answer
68 views

Algebraic Proof that a Disk is Convex

After searching on Google for a while, I cannot seem to find an algebraic proof that a disk is a convex set. Intuitively, this seems obvious: if you take any two points $x, y$ in a disk, then the line ...
1
vote
1answer
45 views

Sets defined by distance to a convex set

Let $Y \subset \mathbb R^n$ be a bounded convex set, let $R>0$, and let $$Z := \left\{z \in \mathbb R^n : d(z,Y) > \dfrac12R \right\}$$ where $$ d(z,Y) = \inf_{y\in Y}|y-z|. $$ If you like, ...
1
vote
0answers
27 views

Generalisation of circumscribed circle for polygones instead of triangles.

Given a triangle, there exists a unique circle passing through its $3$ vertices. I wonder if more generally for any $n\geq3$ we can define a family $\mathcal{C}_n$ of convex closed curves in the ...
4
votes
3answers
206 views

Proving the Obvious

Is it normal that I have the hardest time when I'm trying to prove statements that are blatantly obvious on a visual and/or intuitive level? For instance, how does one go about formally proving the ...
2
votes
2answers
33 views

Convex set for a set of points in 2d plane

There are set of five points $A(0,0) ,B(1,1) ,C(2,0) ,D(2,2).E(0,2) F(1.5,1.5)$ $S=\{A,B,C,D,E,F\}$ Please tell me whether my understanding is correct or not! The points $A,C,D,E$ forms a convex ...
0
votes
0answers
29 views

How to find a curve inside a non-convex

I want to connect two points in a space within the space. If the space is convex, I can simple draw a line between them. But how about a non-convex space. How can I find a curve connecting these two ...
2
votes
0answers
112 views

Voronoi-Diagram - split concave polygon

I have a concave polygon c and a set of points p[]. What I need is to have a set of polygons splitted by the voronoi-diagram. My problem is the following: I already found a library to calculate the ...
0
votes
1answer
34 views

Geometry question with convexity

Assume that a function $h(\lambda)$ is decreasing and convex given interval $[l,u]$ and has an unique root $\lambda^*\in (l,u)$. Also, assume $|l-\lambda^*| > |\lambda^*-u|$. Consider any $z\in ...
5
votes
0answers
70 views

Shortest closed loop containing all extreme points of a convex set

Suppose $S\subset \mathbb{R}^2$ is compact and convex. Suppose $\Gamma:[0,1]\to\mathbb{R}^2$ is a continuous map with $\Gamma(0)=\Gamma(1)$. Suppose $\Gamma$ passes through all extreme points of $S$. ...
1
vote
1answer
56 views

Normed space problem

I am currently dealing with the following problem: Imagine you have two points $x,y$ in a normed space $(X,||.||)$ and in a convex set $K \subset X$. Now you know that $B_{\varepsilon}(x) \subset ...
2
votes
1answer
68 views

Convex polygon is connected by broken lines with each chain parallel to one of two vectors

Given is convex polygon $P$ on the plane. Settle if there are two vectors $\vec{a}$, $\vec{b}$ such that any two points belonging to the polygon $P$ you can connect a broken line contained in the ...
1
vote
0answers
30 views

What is first edge position in the Minkowski sum of two convex polygons in the plane?

I am trying to understand the informal algorithm of the Minkowski sum of two convex polygons in the plane as described here: ...
1
vote
0answers
74 views

Relative Interior and dense subsets

(Due to no answers, I also posted this question here.) Let $A,B\subseteq \mathbb R^d$ be non-empty, such that $B\subseteq \overline A.$ For $S\subseteq\mathbb R^d$ define the relative interior of $S$ ...
4
votes
0answers
83 views

Characterization of Convex Polygons

John Lee's Axiomatic Geometry has an interesting characterization of convex and non-convex vertices for polygons. Let $P$ be a polygon. Consider a ray emanating from a vertex of $P$ which does not ...
1
vote
1answer
20 views

Formula for extracting bounding points from a given set of points

I have a set of geographic locations, i.e. points defined by latitude and longitude. Given this set of points, I need to select only those of them that belong to the surface bounds. The simplest ...
1
vote
1answer
44 views

Does a discrete set of points in $\mathbb{R}^{n}$ define a locally finite collection of hyperplanes?

Let $v_{1},v_{2},...$ be a discrete set of non-zero vectors in $\mathbb{R}^{n}$. By discrete, I mean that any $v_{i}$ is surrounded by an $\epsilon$-ball not containing any other point $v_{j}$. ...
2
votes
0answers
132 views

Infimum over area of certain convex polygons

Let us identify the Euclidean plane with the complex plane $\Bbb C$. For every $n\ge 1$, consider the following collection of finite sets in $\Bbb C^{n+1}$: $$S_n:=\{(z_0,z_1,\dots,z_n)\in\Bbb ...
3
votes
0answers
56 views

Biggest ellipse included in a convex polygon

Considering a N edges convex 2D polygon called P. Let's name its vertices $\{p_1, p_2, ..., p_N\}$ described in a counter-clockwise order, with $p_i = (x_i, y_i)$ What would be, and how would one ...
1
vote
0answers
44 views

Convex polyhedron is union of simplices

Given a convex polyhedron $P$, how can we prove that every point $x \in P$ is in some simplex whose vertices are vertices of $P$? One proof is to inductively build a triangulation of $P$. If $P$ is ...
5
votes
1answer
204 views

Why does the amoeba shrink to its skeleton when we go to infinity?

Let $f\in\mathbb{C}[X_1^{\pm1},\ldots,X_n^{\pm1}]$ a Laurent polynomial. Let $\mathrm{Log}:(\mathbb{C}\setminus\{0\})^n\to\mathbb{R}^n$ defined by ...
1
vote
2answers
77 views

Number of faces of convex hull

If you have $n$ points in $d$-dimensional Euclidean space, the number of faces of the convex hull is potentially exponential I understand. How can this be proved?
10
votes
2answers
184 views

n-simplex in an intersection of n balls

Consider a $n$-simplex, $n \geq 2$ with vertices $x_i,i=1,...,n+1$. 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$ ...
1
vote
1answer
108 views

A weak version of Markov-Kakutani fixed point theorem

Let $\emptyset \not = X\subseteq \Bbb{R}^n$ be convex and compact and let $\cal{A}$ be a commuting family of affine maps from $\Bbb{R}^n$ into $\Bbb{R}^n$ such that $X$ is invariant under each element ...