Intersecting Convex Sets by Rays

What is the smallest number τ=τ(n) such that for any collection of n pairwise disjoint convex sets in d-dimensional Euclidean space, there is a point such that any ray (half-line) emanating from it meets at most τ sets of the collection? This question of Urrutia is closely related to the notion of regression depth introduced by Rousseeuw and Hubert (1996). We show the following:Given any collection \({\mathcal{C}}\) of n pairwise disjoint compact convex sets in d-dimensional Euclidean space, there exists a point p such that any ray emanating from p meets at most \(\frac{dn+1}{d+1}\) members of \({\mathcal{C}}\).There exist collections of n pairwise disjoint (i) equal-length segments or (ii) disks in the Euclidean plane such that from any point there is a ray that meets at least \(\frac{2n}{3}-2\) of them.We also determine the asymptotic behavior of τ(n) when the convex bodies are fat and of roughly equal size.     

随机赋范线性空间中的凸集与凸性

本文定义了随机赋范线性空间中各种凸集和凸性，研究了它们的特性及相互间关系．     

Planar Digraphs without Large Acyclic Sets

Given a directed graph, an acyclic set is a set of vertices inducing a directed subgraph with no directed cycle. In this note, we show that for all integers , there exist oriented planar graphs of order n and digirth g for which the size of the maximum acyclic set is at most . When this result disproves a conjecture of Harutyunyan and shows that a question of Albertson is best possible.     

Slicing Convex Sets and Measures by a Hyperplane

Given convex bodies K ₁,…,K _d in ℝ ^d and numbers α ₁,…,α _d ∈[0,1], we give a sufficient condition for existence and uniqueness of an (oriented) halfspace H with Vol (H∩K _i )=α _i ⋅Vol K _i for every i. The result is extended from convex bodies to measures.     

Mazur Sets in Normed Spaces

In this paper we investigate different questions concerning Mazur sets in normed spaces, which point out the close connections between geometric functional analysis and discrete geometry. Motivated by a result of Chen and Lin, we study the relationship between Mazur disks and weak* denting points of the dual unit ball. We prove that the only Mazur sets of the spaces l₁ⁿ are points and closed balls. Finally, a new stability property for the family of all sets which are intersections of closed balls is found.     

Geometric Condition Measures and Smoothness Condition Measures for Closed Convex Sets and Linear Regularity of Infinitely Many Closed Convex Sets

In this paper, we study geometric condition measures and smoothness condition measures of closed convex sets, bounded linear regularity, and linear regularity. We show that, under certain conditions, the constant for the linear regularity of infinitely many closed convex sets can be characterized by the geometric condition measure of the intersection or by the smoothness condition measure of the intersection. We study also the bounded linear regularity and present some interesting properties of the general linear regularity problem.The author is grateful to the referees for valuable and constructive suggestions. In particular, she thanks a referee for drawing her attention to Corollary 5.14 of Ref. 3, which inspired her to derive Theorem 4.2 and Corollary 4.2 in the revision of this paper.     

On Convex Class of Pairs of Convex Bodies

In this paper we introduce a quotient class of pairs of convex bodies in which every member have convex union.

     

Convex -closures versus convex norm-closures in dual Banach spaces

A subset Y of a dual Banach space X^* is said to have the property (P) if for every weak^*-compact subset H of Y. The purpose of this paper is to give a characterization of the property (P) for subsets of a dual Banach space X^*, and to study the behavior of the property (P) with respect to additions, unions, products, whether the closed linear hull has the property (P) when Y does, etc. We show that the property (P) is stable under all these operations in the class of weak^* -analytic subsets of X^*.     

Plurisubharmonic Functions on the Octonionic Plane and <Emphasis Type="Italic">Spin</Emphasis>(9)-Invariant Valuations on Convex Sets

A new class of plurisubharmonic functions on the octonionic plane is introduced. An octonionic version of theorems of A.D. Aleksandrov (Vestnik Leningrad. Univ. Ser. Mat. Meh. Astr. 13(1):5–24, 1958) and Chern-Levine-Nirenberg (Global Analysis, pp. 119–139, 1969), and Błocki (Proc. Am. Math. Soc. 128(12):3595–3599, 2000) are proved. These results are used to construct new examples of continuous translation invariant valuations on convex subsets of . In particular, a new example of Spin(9)-invariant valuation on ℝ¹⁶ is given. Partially supported by ISF grant 1369/04.     

Empty Convex Hexagons in Planar Point Sets

Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that form a convex hexagon without any points from the set in its interior. Such a configuration is called an empty convex hexagon. In this paper, we answer the question in the affirmative. We show that every set that contains the vertex set of a convex 9-gon also contains an empty convex hexagon.     

Remotality of Closed Bounded Convex Sets in Reflexive Spaces

Let X be a Banach space and E be a closed bounded subset of X. For x ? X, we define D(x, E) = sup{‖ x ? e‖:e ? E}. The set E is said to be remotal (in X) if, for every x ? X, there exists e ? E such that D(x, E) = ‖x ? e‖. The object of this paper is to characterize those reflexive Banach spaces in which every closed bounded convex set is remotal. Such a result enabled us to produce a convex closed and bounded set in a uniformly convex Banach space that is not remotal. Further, we characterize Banach spaces in which every bounded closed set is remotal.     

Finite Sets as Complements of Finite Unions of Convex Sets

Suppose S?? ^d is a set of (finite) cardinality n, whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem of Björner and Kalai yields a lower bound. Much cruder estimates are then obtained when the openness restriction is dropped. For a given set S the problem of determining the smallest number of convex sets whose union is ? ^d ?S is shown to be equivalent to the problem of finding the chromatic number of a certain (infinite) hypergraph ? _S . We consider the graph \(\mathcal {G}_{S}\) whose edges are the 2-element edges of ? _S , and we show that, when d=2, for any sufficiently large set S, the chromatic number of \(\mathcal{G}_{S}\) will be large, even though there exist arbitrarily large finite sets S for which \(\mathcal{G}_{S}\) does not contain large cliques.     

Description of Continuous Isometry Covariant Valuations on Convex Sets

We present a characterization of continuous isometry covariant valuations on convex sets. The main result generalizes previous results of Hadwiger and Hadwiger and Schneider.     

Differences of Convex Compact Sets in the Space of Directed Sets. Part II: Visualization of Directed Sets

This paper is a continuation of the author's first paper (Set-Valued Anal. 9 (2001), pp. 217–245), where the normed and partially ordered vector space of directed sets is constructed and the cone of all nonempty convex compact sets in R ⁿ is embedded. A visualization of directed sets and of differences of convex compact sets is presented and its geometrical components and properties are studied. The three components of the visualization are compared with other known differences of convex compact sets.     

Convex, Acyclic, and Free Sets of an Oriented Matroid

We study the global and local topology of three objects associated to a simple oriented matroid: the lattice of convex sets, the simplicial complex of acyclic sets, and the simplicial complex of free sets. Special cases of these objects and their homotopy types have appeared in several places in the literature. The global homotopy types of all three are shown to coincide, and are either spherical or contractible depending on whether the oriented matroid is totally cyclic. Analysis of the homotopy type of links of vertices in the complex of free sets yields a generalization and more conceptual proof of a recent result counting the interior points of a point configuration. Received October 23, 2000, and in revised form May 3, 2001. Online publication November 2, 2001.     

Dominating Sets for Convex Functions with Some Applications

A number of optimization methods require as a first step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this paper, we address the problem of constructing dominating sets for problems whose objective is a componentwise nondecreasing function of (possibly an infinite number of) convex functions, and we show how to obtain a convex dominating set in terms of dominating sets of simpler problems. The applicability of the results obtained is illustrated with the statement of new localization results in the fields of linear regression and location.     

On Decompositions of Compact Convex Sets

The present paper generalizes M. Edelstein's theorem on the indecomposability of compact convex sets in locally convex linear topological spaces to spherical and hyperbolic geometry. Moreover, the indecomposability of compact intervals in EU¹ w.r.t. homeomorphisms of EU¹ onto itself is shown.     

Differences of Convex Compact Sets in the Space of Directed Sets. Part I: The Space of Directed Sets

A normed and partially ordered vector space of so-called directed sets is constructed, in which the convex cone of all nonempty convex compact sets in R ⁿ is embedded by a positively linear, order preserving and isometric embedding (with respect to a new metric stronger than the Hausdorff metric and equivalent to the Demyanov one). This space is a Banach and a Riesz space for all dimensions and a Banach lattice for n=1. The directed sets in R ⁿ are parametrized by normal directions and defined recursively with respect to the dimension n by the help of a support function and directed supporting faces of lower dimension prescribing the boundary. The operations (addition, subtraction, scalar multiplication) are defined by acting separately on the support function and recursively on the directed supporting faces. Generalized intervals introduced by Kaucher form the basis of this recursive approach. Visualizations of directed sets will be presented in the second part of the paper.