Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon

In this article, we deal with some computational aspects of geodesic convex sets. Motzkin-type theorem, Radon-type theorem, and Helly-type theorem for geodesic convex sets are shown. In particular, given a finite collection of geodesic convex sets in a simple polygon and an “oracle,” which accepts as input three sets of the collection and which gives as its output an intersection point or reports its nonexistence; we present an algorithm for finding an intersection point of this collection.     

Power-law estimates for the central limit theorem for convex sets

We investigate the rate of convergence in the central limit theorem for convex sets established in [B. Klartag, A central limit theorem for convex sets, Invent. Math., in press. [8]]. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the original proof of the central limit theorem for convex sets.     

The affine representation theorem for abstract convex geometries

A convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which captures a combinatorial essence of “convexity” shared by some objects including finite point sets, partially ordered sets, trees, rooted graphs. In this paper, we introduce a generalized convex shelling, and show that every convex geometry can be represented as a generalized convex shelling. This is “the representation theorem for convex geometries” analogous to “the representation theorem for oriented matroids” by Folkman and Lawrence. An important feature is that our representation theorem is affine-geometric while that for oriented matroids is topological. Thus our representation theorem indicates the intrinsic simplicity of convex geometries, and opens a new research direction in the theory of convex geometries.     

Banach空间上凸集的凸性

以Banach空间的一般凸集为研究对象,将Banach空间的凸性研究推广到了内部非空的凸集上．打破了从单位球出发研究Banach空间几何的具有局限性的研究方法,给出了严格凸集的若干特征刻画及性质,并得到了严格凸集和光滑集之间的对偶定理．     

Uniqueness of supporting hyperplanes and an alternative to solutions of variational inequalities

A uniqueness theorem of supporting hyperplanes for a class of convex level sets in a Hilbert space is obtained. As an application of this result, we prove an alternative theorem on solutions of variational inequalities defined on convex level sets. Three examples are given to demonstrate the usefulness and advantages of our alternative theorem.     

Computability of Minimizers and Separating Hyperplanes

We prove in recursive analysis an existence theorem for computable minimizers of convex computable continuous real-valued functions, and a computable separation theorem for convex sets in ?^m. Mathematics Subject Classification: 03F60, 52A40.     

Order Types of Convex Bodies

We prove a Hadwiger transversal-type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the order type of a family of convex bodies, generalizing the usual definition of order type for point sets. This order type turns out to be an oriented matroid. We also give new upper bounds on the Erdős–Szekeres theorem in the context of convex bodies.     

Even valuations on convex bodies

The notion of even valuation is introduced as a natural generalization of volume on compact convex subsets of Euclidean space. A recent characterization theorem for volume leads in turn to a connection between even valuations on compact convex sets and continuous functions on Grassmannians. This connection can be described in part using generating distributions for symmetric compact convex sets. We also explore some consequences of these characterization results in convex and integral geometry.

     

A Helly-type theorem for higher-dimensional transversals

We prove that a collection of compact convex sets of bounded diameters in that is unbounded in k independent directions has a k-flat transversal for k<d if and only if every d+1 of the sets have a k-transversal. This result generalizes a theorem of Hadwiger(–Danzer–Grünbaum–Klee) on line transversals for an unbounded family of compact convex sets. It is the first Helly-type theorem known for transversals of dimension between 1 and d−1.     

On Finite Linear Systems Containing Strict Inequalities

This paper deals with linear systems containing finitely many weak and/or strict inequalities, whose solution sets are referred to as evenly convex polyhedral sets. The classical Motzkin theorem states that every (closed and convex) polyhedron is the Minkowski sum of a convex hull of finitely many points and a finitely generated cone. In this sense, similar representations for evenly convex polyhedra have been recently given by using the standard version for classical polyhedra. In this work, we provide a new dual tool that completely characterizes finite linear systems containing strict inequalities and it constitutes the key for obtaining a generalization of Motzkin theorem for evenly convex polyhedra.     

Jensen's inequality for random elements in metric spaces and some applications

Jensen's inequality is extended to metric spaces endowed with a convex combination operation. Applications include a dominated convergence theorem for both random elements and random sets, a monotone convergence theorem for random sets, and other results on set-valued expectations in metric spaces and on random probability measures.     

A STRONG OPTIMIZATION THEOREM IN LOCALLY CONVEX SPACES

This paper presents a geometric characterization of convex sets in locally convex spaces on which a strong optimization theorem of the Stegall-type holds, and gives Collier's theorem of w Asplund spaces a localized setting.     

Local completeness, drop theorem and Ekeland's variational principle

By using a very general drop theorem in locally convex spaces we obtain some extended versions of Ekeland's variational principle, which only need assume local completeness of some related sets and improve Hamel's recent results. From this, we derive some new versions of Caristi's fixed points theorems. In the framework of locally convex spaces, we prove that Daneš' drop theorem, Ekeland's variational principle, Caristi's fixed points theorem and Phelps lemma are equivalent to each other.     

Tverberg-Type Theorems for Intersecting by Rays

In this paper we consider some results on intersection between rays and a given family of convex, compact sets. These results are similar to the central point theorem, and Tverberg’s theorem on partitions of a point set.     

A colorful theorem on transversal lines to plane convex sets

We prove a colorful version of Hadwiger’s transversal line theorem: if a family of colored and numbered convex sets in the plane has the property that any three differently colored members have a transversal line that meet the sets consistently with the numbering, then there exists a color such that all the convex sets of that color have a transversal line. All authors are partially supported by CONACYT research grant 5040017.     

Sur la fonction extrémale plurisousharmonique relative à deux convexes

We prove results which are parallel to Lempert's theorem on the plurisbharmonic Green function of a convex domain for the extremal plurisubharmonic function relative to two convex domains. Namely, its sublevel sets are convex and the region between the two domains is foliated by complex curves on which the relative extremal function is harmonic.     

Convex fuzzy sets

This paper gathers some elementary known results about convex fuzzy sets and completes the theory, introducing the necessary concepts. Using a representation theorem for fuzzy subspaces it gives separation theorems for convex fuzzy sets in the proper setting.     

One approach to constructing a minimal convex hull

The minimal convex hull of a subset of finite-dimensional space is constructed in a discrete fashion: at each step, we construct a new set that includes the inherited set. The procedure for finding the chain of sets involves geometrically evident constructions. This chain becomes stationary; i.e., from some number onward, all the sets of the chain being constructed coincide with the minimal convex hull. Our approach uses the principal result (Caratheodory’s theorem) underlying the conventional approach to constructing a minimal convex hull.     

Approximation of convex data

A method is described of obtaining convex polynomial approximations to discrete sets of convex data. The approximations are best convex combinations of certain component convex functions. A Weierstrass-type theorem is proved, to justify the choice of component functions, and numerical illustrations are given.     

Unified approach to some geometric results in variational analysis

Based on a study of a minimization problem, we present the following results applicable to possibly nonconvex sets in a Banach space: an approximate projection result, an extended extremal principle, a nonconvex separation theorem, a generalized Bishop-Phelps theorem and a separable point result. The classical result of Dieudonné (on separation of two convex sets in a finite-dimensional space) is also extended to a nonconvex setting.