The tag has no wiki summary.

learn more… | top users | synonyms

3
votes
1answer
192 views

Map from a convex polygon that increases distance

At the risk of asking an extremely stupid question, suppose that $P\subset\mathbb{R}^2$ is a convex polygon with area $1$ that contains the origin, and let $r$ denote the farthest distance between the ...
10
votes
2answers
327 views

Inequalities for averaging over partially ordered sets

Let's start from a classical inequality: If $0\le a_1\le\cdots\le a_k$ and $0\le b_1\le\cdots\le b_k$ then $(a_1+\cdots+a_k)(b_1+\cdots+b_k)\le k(a_1b_1+\cdots+a_k b_k)$. It can be written also in ...
10
votes
1answer
297 views

Tverberg's theorem in CAT(0) spaces

Does Tverberg's theorem hold for CAT(0) spaces of covering dimension $d<\infty$: Is it true that for any $d$-dimensional $CAT(0)$-space $X$ and a subset $E\subset X$ of cardinality $(d + 1)(r - ...
6
votes
0answers
151 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 ...
13
votes
2answers
259 views

Lattice points and convex bodies

Given are two convex bodies $K, L \subset \mathbb{R}^n$ that contain the origin as an interior point. Assume the number of integer points contained in $\lambda K$ equals the number of integer points ...
1
vote
0answers
205 views

Proof of an inequality for a linear combination of three trigonometric functions

Given a function $$f(t) = k_{1} \sin(t+\alpha) + k_{3} \sin(3t+\beta) + k_{5} \sin(5t+\gamma)$$ where $k_{1}, k_{3}$ and $k_{5}$ are all positive parameters, and the three phase angles, $ ...
6
votes
0answers
125 views

Variations on a problem of S. Mazur

In problem 76 of the Scottish Book Mazur asked Given a convex body $K$ in three-dimensional space and a point $o$ in its interior, consider the surface $S$ formed by all points $p$ such that the ...
-1
votes
1answer
46 views

Determining the sign of each element of the optimal of a strict convex function

The problem is: Let $\vec{x}\in\mathbb{R}^d$ be the variable and $f(\vec{x})$ be a scalar function that is globally strictly convex in $\mathbb{R}^d$. We assume the unique optimum of $f$ to be ...
4
votes
1answer
186 views

A construction related to scissors congruence

I was thinking about the following some time ago. My question is whether such things have been studied before. Let $E_n$ be the abelian group with a generator for each (bounded) euclidean polytope of ...
0
votes
0answers
60 views

Uniform approximation of tangent cone

Let $\mathcal{C}$ be a convex and closed set in $\mathbb{R}^n$ containing $0$. The tangent cone of $\mathcal{C}$ at $0$ is given as, \begin{equation} T_{\mathcal{C}}(0)=Cl(\text{cone}(\mathcal{C})) ...
0
votes
0answers
98 views

Uniform convergence of difference quotients of a convex function

Let $f(\cdot):\mathbb{R}^n\rightarrow \mathbb{R}$ be a convex function. At $x$ denote the subdifferential by $\partial f(x)$ which is compact and closed. Now, define the approximation of $f$ around a ...
0
votes
1answer
533 views

Is a convex function continuous and almost everywhere differentiable? [closed]

is this statement true ? assume $f:D\rightarrow \mathbf{R} $ is a convex function where $D\subset \mathbf{R}^n$ is a convex set. $f$ is continuous and almost everywhere differentiable and in class ...
1
vote
1answer
181 views

How to examine the convexity of a complex function numerically?

I have a function which does not have a closed form . Large numerical effort should be done to evaluate the function for even a single point. How can I examine the convexity of my function over the ...
0
votes
1answer
176 views

carleman inequality

Is there a connection between carleman inequality discovred by T. Carleman in 1922 if I am not mistaken in his research on quasianalytic functions and what is called Carleman estimates used in the PDE ...
2
votes
0answers
98 views

Why pseudoconvexity is important in Partial differential equation theory?

I am a new researcher in mathematics and I work on convexity. Are convexity and pseudoconvexity related topics and in which respect to PDE theory ? One of the important results in PDE theory is the ...
1
vote
2answers
196 views

Construction of a convex function nondifferentiable on a countable set [closed]

Let $H$ be a countable subset of $[0,1]$. Construct a convex function $f:[0,1]\rightarrow\mathbb{R}$ such that $f$ is nondifferentiable on $H$ and differentiable in the rest.
0
votes
2answers
134 views

Convexity of a minimum function

I was reading a proof of $9g-9$ theorem which states that $9g-9$ length parameters are sufficient the parametrize the Teichmuller space of a closed surface of genus $g$. The proof uses the following ...
4
votes
0answers
111 views

Hilbert metric of a sum of cones

Suppose that $K_{1}$ and $K_{2}$ are pointed closed cones in a finite-dimensional space $V$ whose Hilbert metrics $d_{1},d_{2}$ are known. Is there a way to express the Hilbert metric of $K_{1}+K_{2}$ ...
1
vote
1answer
132 views

A question concerning convex functions

Consider points $a,b,c$ (not on a line) and $x_1,...,x_n$ in $\Bbb{R}^2$. I am looking for a necessary and sufficient condition in terms of the geometric configuration of these points such that for ...
8
votes
1answer
414 views

Small quadrilaterals containing a given convex region

It is easy to prove that (*) Every convex planar set of area 1 is contained in a quadrilateral of area 2. It is also easy to see that statement (*) remains true if the constant 2 is replaced with a ...
1
vote
0answers
54 views

Symmetry of Sundry Planar Convex Sets of Constant Width & Minimal Area

In a much broader paper in “Optimization Methods & Software 27,6 (2012) pp1073-1099” Bayen & Henrion consider planar compact, convex sets with support functions which are finite Fourier ...
1
vote
0answers
91 views

Linearization of cones

Suppose that $K$ is a closed convex cone in $R^{n}$. Is there a "nice" function $f:R^{n} \rightarrow R^{m}$ so that $f(K)$ is a subspace? What about an approximate subspace?
1
vote
0answers
57 views

Reference request: Compact metrizable semilattices with small connected semilattices are absolute retracts

Let $X$ be a compact metrizable topological semilattice with a neighbourhood base of sub-semilattices that are path connected. I need a reference for a proof that $X$ is an absolute retract. Here is ...
1
vote
1answer
148 views

Helly's number from biconvex functions

Helly's Theorem states the following. Suppose $X_1,X_2,...,X_N$ are convex sets in $\mathbb{R}^d$, such that for any index-set $I$ with $|I| \leq h(d) := d+1$, we have $\bigcap_{i \in I} X_i \neq ...
0
votes
0answers
49 views

convexity of two linear spaces connected by convex nonlinear equality constraints

If there are two sets of linear constraints in different variables, Ax <= b with x_l <= x <= x_u and Cy <= d with y_l <= y <= y_u, and a set of equality constraints of a specific ...
4
votes
1answer
176 views

Zoll Flat Finsler tori and convex bodies on a starry night

The starry night. The "celestial sphere" is given by set of non-zero vectors in $\mathbb{R}^n$ modulo positive dilations (i.e., $v \equiv w$ if $v = \lambda w$ for some $ \lambda > 0$) and the ...
1
vote
2answers
209 views

On a version of gradient descent

I am trying to read this paper and have gotten stuck. The author considers the problem of minimizing a convex function whose gradient has Lipschitz constant $M$ and considers the scheme $$ x(t+1) = ...
1
vote
1answer
76 views

Constrained minimum maximal distance.

Let $C$ and $D$ be two convex sets. And suppose $C\cap D\neq \emptyset$. Let $x^*$ is the solution to the optimization problem: $$\min_{x\in C} \max_{y \in D} |x-y|^2$$ Is it true that $x^* \in D$. ...
0
votes
2answers
234 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
1answer
146 views

Regularizing a Convex function with itself

Hi, This is a problem that has being bothering me the last few days. Assume a convex function $f(x): {\mathbb R}^n \rightarrow {\mathbb R}$ with a unique minimizer $x^{\star}$. Now consider the ...
2
votes
3answers
223 views

Measuring the distance of a convex set from a ball (Nikodym distance)

Assume we have a centrally symmetric convex set $K \subset \mathbb{R}^n$ such that Vol(K)=1. In addition, assume that for every direction $u$ we know that $Vol(K \Delta R_u(K)) < \epsilon$, where ...
1
vote
0answers
59 views

Which matrix/operator in a cone has the largest negative spectral part?

Background: Let $\mathcal{K}$ be set (convex cone, if you like) of symmetric matrices of order $n$. Each matrix $A \in \mathcal{K}$ can be decomposed in a unique way as $A=A_{+}-A_{-}$, where ...
5
votes
1answer
286 views

A question on the Mahler conjecture

In its asymmetric version, the Mahler conjecture states that if $K \subset \mathbb{R^n}$ is a convex body containing the origin as an interior point and $$ K^* := \{y \in \mathbb{R}^n : \langle y, x ...
1
vote
1answer
225 views

When does the finite union of convex sets have a hole in it?

Let $f_1, \dots, f_j$ be convex functions from $\mathbb{R}^n \to \mathbb{R}$. I am trying to develop a test that decides whether or not the set $\{x | f_1(x) \le k_1\} \cup \dots \cup \{x | f_n(x) ...
3
votes
1answer
99 views

What is the doubling dimension of convex functions?

I am interested in the complexity of convex functions, specifically the "doubling dimension" of the class of convex functions defined on a compact subset of Euclidean space, when compared using the ...
3
votes
2answers
339 views

Is Ryser's conjecture on permanent minimizers still open?

Let $A(k,n)$ be the set of $\{0,1\}$ matrices of order $n$ with all their line sums equal to $k$. Conjecture number 5 on the list from Minc's book, attributed to Ryser, says that if $A(k,n)$ ...
3
votes
0answers
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 ...
0
votes
1answer
183 views

Extensions of Carathéodory's theorem

We know about the Carathéodory's theorem which is on the convex bodies of $\mathbb{R}^d$. My question is, how far we can extend it? Is it true for say, any convex object of Banach space, or for convex ...
4
votes
1answer
173 views

Monotonicity of Loewner ellipsoid?

Given two $0$-symmetric convex bodies $K \subset L \subset \mathbb{R}^n$, is it true that the Loewner ellipsoid of $K$ is contained in the Loewner ellipsoid of $L$? I have just finished a proving a ...
3
votes
1answer
385 views

Why are all these families of polynomials finally log-concave?

This started when I was examining certain families of unimodal polynomials, i.e. $\sum_{k=0}^n a_kx^k$ where $a_0\le a_1\le\cdots \le a_k\ge\cdots \ge a_n$. (Notation: in the following, the $a_k$ ...
3
votes
1answer
266 views

Possible to find a set of log-concave functions with log-concave sums?

While the set of log-convex functions is closed under addition, the set of log-concave functions is not. Yet if $f$ is log-concave, $\ln(k f) = \ln(k)+\ln(f)$, with $k \in \mathbb{R}^+$ constant, is ...
2
votes
0answers
42 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 = ...
6
votes
2answers
145 views

On the convexity of element-wise norm 1 of the inverse

Question first asked on math.stackexchange here: http://math.stackexchange.com/questions/317209/on-the-convexity-of-element-wise-norm-1-of-the-inverse On the convexity of element-wise norm 1 of the ...
2
votes
0answers
68 views

Fastest 'Oracle' Algorithm for satisfying a single linear constraint on a convex set?

In this paper by Arora, Hazan, and Kale (http://www.cs.princeton.edu/~arora/pubs/MWsurvey.pdf) a method is given for using the Multiplicative Weights Update algorithm to quickly solve Linear Programs ...
5
votes
2answers
276 views

How do you prove that every curve of constant width is convex?

Cross-posted from math.stackexchange: Let C be a simple closed plane curve and let D be its interior. Recall that the width of C in a direction θ is the distance between two supporting lines for D ...
3
votes
1answer
138 views

Support Functions Of 3D Convex Bodies In Spherical Polar Coordinates

What are the known sufficient conditions,analagous to the planar curvature condition, in terms of functions of theta and phi, on the support function h(theta,phi) of a surface in 3D which imply it is ...
1
vote
1answer
203 views

Covering the cone of positive semidefinite matrices by intervals

Is it possible to cover the cone of positive semidefinite matrices by a finite/countable/interesting family of closed intervals of matrices? How about a general convex cone? For the finite case the ...
4
votes
5answers
283 views

Characterizing Convex Configurations of Quadrupels of Coplanar Points via Linear (In-)equalities between Distance Sums or Differences

Given 4 points $A$, $B$, $C$ and $D$ in general position in the euclidean plane, is it possible to determine from the 6 distances $AB$, $BC$, $CD$, $AD$, $AC$ and, $BD$ alone, whether every point is a ...
2
votes
1answer
217 views

another diameter-perimeter-area inequality

Recently I learnt that $$ \inf\frac{diam(C)(per(C)-2diam(C))}{area(C)}=0$$ where the infimum is taken over all plane convex bodies $C$ (say, with non-zero area). In other words, there is no ...
3
votes
2answers
262 views

a diameter-perimeter-area inequality for convex figures

Is the following inequality known? I believe it's true, but I could find no reference. For any convex body $C$ in the plane we have $$\left(4-\frac{8}{\pi}\right)area(C)\leq > ...