An Extension of Milman's Reverse Brunn-Minkowski Inequality.
We prove that there exist constants C>0 and 0 < λ < 1 so that for all convex bodies K in with non-empty interior and all integers k so that 1 ≤ k ≤ λn/ln(n+1), there exists a k-dimensional affine subspace Y of satisfying . This formulation of Dvoretzky’s theorem for large dimensional sections is a generalization with a new proof of the result due to Milman and Schechtman for centrally symmetric convex bodies. A sharper estimate holds for the n-dimensional simplex.
We propose new alternative theorems for convex infinite systems which constitute the generalization of the corresponding to Gale, Farkas, Gordan and Motzkin. By means of these powerful results we establish new approaches to the Theory of Infinite Linear Inequality Systems, Perfect Duality, Semi-infinite Games and Optimality Theory for non-differentiable convex Semi-Infinite Programming Problem.
There is a constant c such that for every n ∈ ℕ, there is an Nₙ so that for every N≥ Nₙ there is a polytope P in ℝⁿ with N vertices and where B₂ⁿ denotes the Euclidean unit ball of dimension n.
Let U, V be two symmetric convex bodies in and |U|, |V| their n-dimensional volumes. It is proved that there exist vectors such that, for each choice of signs , one has where . Hence it is deduced that if a metrizable locally convex space is not nuclear, then it contains a null sequence such that the series is divergent for any choice of signs and any permutation π of indices.
We prove some results in the context of isoperimetric inequalities with quantitative terms. In the -dimensional case, our main contribution is a method for determining the optimal coefficients in the inequality , valid for each Borel set with positive and finite area, with and being, respectively, the and the of . In dimensions, besides proving existence and regularity properties of minimizers for a wide class of including the lower semicontinuous extension of , we describe the...