The geometry of p-convex intersection bodies

Busemann's theorem states that the intersection body of an origin-symmetric convex body is also convex. In this paper we provide a version of Busemann's theorem for p-convex bodies. We show that the intersection body of a p-convex body is q-convex for certain q. Furthermore, we discuss the sharpness of the previous result by constructing an appropriate example. This example is also used to show that IK, the intersection body of K, can be much farther away from the Euclidean ball than K. Finally, we extend these theorems to some general measure spaces with log-concave and s-concave measures.     

On the Stability of the p-Affine Isoperimetric Inequality

Employing the affine normal flow, we prove a stability version of the p-affine isoperimetric inequality for p≥1 in ?² in the class of origin-symmetric convex bodies. That is, if K is an origin-symmetric convex body in ?² such that it has area π and its p-affine perimeter is close enough to the one of an ellipse with the same area, then, after applying a special linear transformation, K is close to an ellipse in the Hausdorff distance.     

Six Kinds of Roughly Convex Functions

This paper considers six kinds of roughly convex functions, namely: δ-convex, midpoint δ-convex, ρ-convex, γ-convex, lightly γ-convex, and midpoint γ-convex functions. The relations between these concepts are presented. It is pointed out that these roughly convex functions have two optimization properties: each r-local minimizer is a global minimizer, and if they assume their maximum on a bounded convex domain D (in a Hilbert space), then they do so at least at one r-extreme point of D, where r denotes the roughness degree of these functions. Furthermore, analytical properties are investigated, such as boundedness, continuity, and conservation properties.     

Partial Convexity

We study OC-convexity, which is defined by the intersection of conic semispaces of partial convexity. We investigate an optimization problem for OC-convex sets and prove a Krein--Milman type theorem for OC-convexity. The relationship between OC-convex and functionally convex sets is studied. Topological and numerical aspects, as well as separability properties are described. An upper estimate for the Carathéodory number for OC-convexity is found. On the other hand, it happens that the Helly and the Radon number for OC-convexity are infinite. We prove that the OC-convex hull of any finite set of points is the union of finitely many polyhedra.     

Projection problems for symmetric polytopes

Let K⊂Rn be a convex body (a compact, convex subset with non-empty interior), ΠK its projection body. Finding the least upper bound, as K ranges over the class of origin-symmetric convex bodies, of the affine-invariant ratio V(ΠK)/V(K)ⁿ⁻¹, being called Schneider's projection problem, is a well-known open problem in the convex geometry. To study this problem, Lutwak, Yang and Zhang recently introduced a new affine invariant functional for convex polytopes in Rn. For origin-symmetric convex polytopes, they posed a conjecture for the new functional U(P). In this paper, we give an affirmative answer to the conjecture in Rn, thereby, obtain a modified version of Schneider's projection problem.     

On a normed version of a Rogers–Shephard type problem

A translation body of a convex body is the convex hull of two of its translates intersecting each other. In the 1950s, Rogers and Shephard found the extremal values, over the family of n-dimensional convex bodies, of the maximal volume of the translation bodies of a given convex body. In our paper, we introduce a normed version of this problem, and for the planar case, determine the corresponding quantities for the four types of volumes regularly used in the literature: Busemann, Holmes–Thompson, and Gromov’s mass and mass*. We examine the problem also for higher dimensions, and for centrally symmetric convex bodies.     

Proximity theorems of discrete convex functions

A proximity theorem is a statement that, given an optimization problem and its relaxation, an optimal solution to the original problem exists in a certain neighborhood of a solution to the relaxation. Proximity theorems have been used successfully, for example, in designing efficient algorithms for discrete resource allocation problems. After reviewing the recent results for L-convex and M-convex functions, this paper establishes proximity theorems for larger classes of discrete convex functions, L₂-convex functions and M₂-convex functions, that are relevant to the polymatroid intersection problem and the submodular flow problem.Mathematics Subject Classification (2000): 90C27, 05B35     

Determination of star bodies from p-centroid bodies

In this paper, we prove that an origin-symmetric star body is uniquely determined by its p-centroid body. Furthermore, using spherical harmonics, we establish a result for non-symmetric star bodies. As an application, we show that there is a unique member of $\Gamma_p\langle K\rangle$ characterized by having larger volume than any other member, for all real p?≥?1 that are not even natural numbers, where $\Gamma_p\langle K\rangle$ denotes the p-centroid equivalence class of the star body K.     

Relations between some basic results derived from two kinds of topologies for a random locally convex module

The purpose of this paper is to exhibit the relations between some basic results derived from the two kinds of topologies (namely the (ε,λ)-topology and the stronger locally L⁰-convex topology) for a random locally convex module. First, we give an extremely simple proof of the known Hahn-Banach extension theorem for L⁰-linear functions as well as its continuous variant. Then we give the relations between the hyperplane separation theorems in [D. Filipovi?, M. Kupper, N. Vogelpoth, Separation and duality in locally L⁰-convex modules, J. Funct. Anal. 256 (2009) 3996-4029] and a basic strict separation theorem in [T.X. Guo, H.X. Xiao, X.X. Chen, A basic strict separation theorem in random locally convex modules, Nonlinear Anal. 71 (2009) 3794-3804]: in the process we also obtain a very useful fact that a random locally convex module with the countable concatenation property must have the same completeness under the two topologies. As applications of the fact, we prove that most of the previously established principal results of random conjugate spaces of random normed modules under the (ε,λ)-topology are still valid under the locally L⁰-convex topology, which considerably enriches financial applications of random normed modules.     

An intersection theorem in L-convex spaces with applications

A new intersection theorem is obtained in L-convex spaces without linear structure. As its applications, a fixed point theorem, a maximal element theorem, a coincidence theorem, some new minimax inequalities and a saddle point theorem are given in L-convex spaces. Our results generalize many known theorems in the literature.     

On perimeters of sections of convex polytopes

In his book “Geometric Tomography” Richard Gardner asks the following question. Let P and Q be origin-symmetric convex bodies in R³ whose sections by any plane through the origin have equal perimeters. Is it true that P=Q? We show that the answer is “Yes” in the class of origin-symmetric convex polytopes. The problem is treated in the general case of Rn.     

On a discrete version of alexandrov’s projection theorem

In this paper, we consider a discrete version of Aleksandrov＇s projection theorem. We prove that an origin-symmetric convex lattice set, whose lattice＇s y-coordinates＇ absolute values are not bigger than 2, can be uniquely determined by its lattice projection counts if its cardinality is not 11. This partly answers a question on the discrete version of Aleksandrov＇s projection theorem which was proposed by Gardner, Gronchi and Zong in 2005.     

Constrained best approximation in Hilbert space III. Applications ton-convex functions

This paper continues the study of best approximation in a Hilbert spaceX from a subsetK which is the intersection of a closed convex coneC and a closed linear variety, with special emphasis on application to then-convex functions. A subtle separation theorem is utilized to significantly extend the results in [4] and to obtain new results even for the “classical” cone of nonnegative functions. It was shown in [4] that finding best approximations inK to anyf inX can be reduced to the (generally much simpler) problem of finding best approximations to a certain perturbation off from either the coneC or a certain subconeC _F. We will show how to determine this subconeC _F, give the precise condition characterizing whenC _F=C, and apply and strengthen these general results in the practically important case whenC is the cone ofn-convex functions inL ₂ (a,b),     

A Geometric Lower Bound Theorem

We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of chordality. Further, for C ²-convex bodies, asymptotically tight lower bounds on the g-numbers of the approximating polytopes are given, in terms of their Hausdorff distance from the convex body.     

Comparison of volumes by means of the areas of central sections

The Busemann–Petty problem asks whether origin-symmetric convex bodies in Rⁿ with smaller areas of all central hyperplane sections necessarily have smaller n-dimensional volume. The solution was completed in the end of the 1990s, and the answer is affirmative if n4 and negative if n5. Since the answer is negative in most dimensions, it is natural to ask what information about the volumes of central sections of two bodies does allow to compare the n-dimensional volumes of these bodies in all dimensions. In this article we give an answer to this question in terms of certain powers of the Laplace operator applied to the section function of the body.     

Comparing volumes by concurrent cross-sections of complex lines: a Busemann–Petty type problem

We consider the problem of comparing the volumes of two star bodies in an even-dimensional Euclidean space \({\mathbb {R}}^{2n} = {\mathbb {C}}^n\) by comparing their cross sectional areas along complex lines (special 2-dimensional real planes) through the origin. Under mild symmetry conditions on one of the bodies a Busemann–Petty type theorem holds. Quaternionic and octonionic analogs also hold. The argument relies on integration in polar coordinates coupled with Jensen’s inequality. Along the way we provide a criterion that detects which centered bodies are circular. i.e., stabilized by multiplication by complex numbers of unit modulus. Our goal is to present a Busemann–Petty type result with a minimum of required background (in the spirit of L. K. Hua’s book on the classical domains) and, in addition, to suggest characterizations of classes of star bodies by means of integral geometric inequalities.     

A surjection theorem and a fixed point theorem for a class of positive operators

This paper is concerned with α-convex operators on ordered Banach spaces. A surjection theorem for 1-convex operators in order intervals is established by means of the properties of cone and monotone iterative technique. It is assumed that 1-convex operator A is increasing and satisfies Ay−Ax?M(y−x) for θ?x?y?v₀, where θ denotes the zero element and v₀ is a constant. Moreover, we prove a fixed point theorem for -convex operators by using fixed point theorem of cone expansion. In the end, we apply the fixed point theorem to certain integral equations.     

Lp-Brunn-Minkowski inequality

We introduce the notion of L_p-mixed intersection body (p < 1) and extend the classical notion dual mixed volume to an L_p setting. Further, we establish the Brunn-Minkowski inequality for the q-dual mixed volumes of star duals of L_p-mixed intersection bodies.     

Generalized intersection bodies are not equivalent

In [A. Koldobsky, A functional analytic approach to intersection bodies, Geom. Funct. Anal. 10 (2000) 1507-1526], A. Koldobsky asked whether two types of generalizations of the notion of an intersection body are in fact equivalent. The structures of these two types of generalized intersection bodies have been studied by the author in [E. Milman, Generalized intersection bodies, J. Funct. Anal. 240 (2) (2006) 530-567], providing substantial evidence for a positive answer to this question. The purpose of this note is to construct a counter-example, which provides a surprising negative answer to this question in a strong sense. This implies the existence of non-trivial non-negative functions in the range of the spherical Radon transform, and the existence of non-trivial spaces which embed in Lp for certain negative values of p.     

A generalized localization theorem and geometric inequalities for convex bodies

In this article, we generalize a localization theorem of Lovász and Simonovits [Random walks in a convex body and an improved volume algorithm, Random Struct. Algorithms 4-4 (1993) 359-412] which is an important tool to prove dimension-free functional inequalities for log-concave measures. In a previous paper [Fradelizi and Guédon, The extreme points of subsets of s-concave probabilities and a geometric localization theorem, Discrete Comput. Geom. 31 (2004) 327-335], we proved that the localization may be deduced from a suitable application of Krein-Milman's theorem to a subset of log-concave probabilities satisfying one linear constraint and from the determination of the extreme points of its convex hull. Here, we generalize this result to more constraints, give some necessary conditions satisfied by such extreme points and explain how it may be understood as a generalized localization theorem. Finally, using this new localization theorem, we solve an open question on the comparison of the volume of sections of non-symmetric convex bodies in Rⁿ by hyperplanes. A surprising feature of the result is that the extremal case in this geometric inequality is reached by an unusual convex set that we manage to identify.