A Decomposition for Sets Having a Segment Convexity Property

1980 ◽  
Vol 32 (1) ◽  
pp. 21-26
Author(s):  
Marilyn Breen

Let 5 be a subset of Euclidean space. The set 5 is said to be m-convex, m ≥ 2, if and only if for every m distinct points of S, at least one of the line segments determined by these points lies in 5. Clearly any union of m mdash — 1 convex sets will be m-convex, yet the converse is false. However, several decomposition theorems have been proved which allow us to write any closed planar m-convex set as a finite union of convex sets, and actual bounds for the decomposition in terms of m have been obtained ([6], [4], [3]). Moreover, with the restriction that (int cl S) ∼ S contain no isolated points, an arbitrary planar m-convex set S may be decomposed into a finite union of convex sets ([1].Here we strengthen the m-convexity condition to define an analogous combinatorial property for segments.

Author(s):  
H. G. Eggleston

SummaryA set X in Euclidean space is Valentine n–convex, or simply n–convex' if it has the following property. If X contains a subset Y consisting of n distinct points then X also contains the points of at least one segment with end points in Y. We show here that the vector sum of two plane compact 3-convex sets is 5-convex (which complements the result of I. D. Calvert(1) that the intersection of two plane compact 3-convex sets is 5-convex) and that the vector sum of a plane connected compact 3-convex set with itself is 4-convex. These results are not true in 4 dimensional space. It is an open question whether or not they are true in 3-dimensional space.


1976 ◽  
Vol 80 (2) ◽  
pp. 223-228
Author(s):  
H. G. Eggleston

A subset X of Euclidean space such that if a, b, c are points of X then at least one of the segments joining two of them lies in X, is said to be V-convex. Valentine (4) showed that in two dimensions a compact V-convex set is the union of at most three convex sets. We show here that if the set of star centres of X is of lower dimension than X and X is a compact V-convex set then it is the union of at most two convex sets.


1966 ◽  
Vol 18 ◽  
pp. 1294-1300 ◽  
Author(s):  
G. C. Shephard

Associated with each bounded convex set K in n-dimensional euclidean space En is a point s(K) known as its Steiner point. First considered by Steiner in 1840 (6, p. 99) in connection with an extremal problem for convex regions, this point has been found useful in some recent investigations (for example, 4) because of the linearity property1Addition on the left is vector addition of convex sets.


2019 ◽  
Vol 27 (1) ◽  
Author(s):  
Sameh Shenawy

Abstract Let $\mathcal {W}^{n}$ W n be the set of smooth complete simply connected n-dimensional manifolds without conjugate points. The Euclidean space and the hyperbolic space are examples of these manifolds. Let $W\in \mathcal {W}^{n}$ W ∈ W n and let A and B be two convex subsets of W. This note aims to investigate separation and slab horosphere separation of A and B. For example,sufficient conditions on A and B to be separated by a slab of horospheres are obtained. Existence and uniqueness of foot points and farthest points of a convex set A in $W\in \mathcal {W}$ W ∈ W are considered.


Author(s):  
Tetiana Osipchuk

The topological properties of classes of generally convex sets in multidimensional real Euclidean space $\mathbb{R}^n$, $n\ge 2$, known as $m$-convex and weakly $m$-convex, $1\le m<n$, are studied in the present work. A set of the space $\mathbb{R}^n$ is called \textbf{\emph{$m$-convex}} if for any point of the complement of the set to the whole space there is an $m$-dimensional plane passing through this point and not intersecting the set. An open set of the space is called \textbf{\emph{weakly $m$-convex}}, if for any point of the boundary of the set there exists an $m$-dimensional plane passing through this point and not intersecting the given set. A closed set of the space is called \textbf{\emph{weakly $m$-convex}} if it is approximated from the outside by a family of open weakly $m$-convex sets. These notions were proposed by Professor Yuri Zelinskii. It is known the topological classification of (weakly) $(n-1)$-convex sets in the space $\mathbb{R}^n$ with smooth boundary. Each such a set is convex, or consists of no more than two unbounded connected components, or is given by the Cartesian product $E^1\times \mathbb{R}^{n-1}$, where $E^1$ is a subset of $\mathbb{R}$. Any open $m$-convex set is obviously weakly $m$-convex. The opposite statement is wrong in general. It is established that there exist open sets in $\mathbb{R}^n$ that are weakly $(n-1)$-convex but not $(n-1)$-convex, and that such sets consist of not less than three connected components. The main results of the work are two theorems. The first of them establishes the fact that for compact weakly $(n-1)$-convex and not $(n-1)$-convex sets in the space $\mathbb{R}^n$, the same lower bound for the number of their connected components is true as in the case of open sets. In particular, the examples of open and closed weakly $(n-1)$-convex and not $(n-1)$-convex sets with three and more connected components are constructed for this purpose. And it is also proved that any compact weakly $m$-convex and not $m$-convex set of the space $\mathbb{R}^n$, $n\ge 2$, $1\le m<n$, can be approximated from the outside by a family of open weakly $m$-convex and not $m$-convex sets with the same number of connected components as the closed set has. The second theorem establishes the existence of weakly $m$-convex and not $m$-convex domains, $1\le m<n-1$, $n\ge 3$, in the spaces $\mathbb{R}^n$. First, examples of weakly $1$-convex and not $1$-convex domains $E^p\subset\mathbb{R}^p$ for any $p\ge3$, are constructed. Then, it is proved that the domain $E^p\times\mathbb{R}^{m-1}\subset\mathbb{R}^n$, $n\ge 3$, $1\le m<n-1$, is weakly $m$-convex and not $m$-convex.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Francesco M. Malvestuto

Given a connected hypergraph with vertex set V, a convexity space on is a subset of the powerset of V that contains ∅, V, and the singletons; furthermore, is closed under intersection and every set in is connected in . The members of are called convex sets. The convex hull of a subset X of V is the smallest convex set containing X. By a cluster of we mean any nonempty subset of V in which every two vertices are separated by no convex set. We say that a convexity space on is decomposable if it satisfies the following three axioms: (i) the maximal clusters of form an acyclic hypergraph, (ii) every maximal cluster of is a convex set, and (iii) for every nonempty vertex set X, a vertex does not belong to the convex hull of X if and only if it is separated from X by a convex cluster. We prove that a decomposable convexity space on is fully specified by the maximal clusters of in that (1) there is a closed formula which expresses the convex hull of a set in terms of certain convex clusters of and (2) is a convex geometry if and only if the subspaces of induced by maximal clusters of are all convex geometries. Finally, we prove the decomposability of some known convexities in graphs and hypergraphs taken from the literature (such as “monophonic” and “canonical” convexities in hypergraphs and “all-paths” convexity in graphs).


1967 ◽  
Vol 7 (3) ◽  
pp. 323-326 ◽  
Author(s):  
M. J. C. Baker

The purpose of this paper is to prove that if n+3, or more, strongly convex sets on an n dimensional sphere are such that each intersection of n+2 of them is empty, then the intersection of some n+1 of them is empty. (The n dimensional sphere is understood to be the set of points in n+1 dimensional Euclidean space satisfying x21+x22+ …+x2n+1 = 1.)


10.37236/1805 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Seog-Jin Kim ◽  
Alexandr Kostochka ◽  
Kittikorn Nakprasit

Let $G$ be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number $k$ is $(3k-3)$-degenerate. This bound is sharp. As a consequence, we derive that $G$ is $(3k-2)$-colorable. We show also that the chromatic number of every intersection graph $H$ of a family of homothetic copies of a fixed convex set in the plane with clique number $k$ is at most $6k-6$.


1971 ◽  
Vol 23 (2) ◽  
pp. 315-324 ◽  
Author(s):  
A. McD. Mercer

1. If f is a real-valued function possessing a Taylor series convergent in (a — R, a + R), then it satisfies the following operational identity1.1in which D2 = d2/du2. Furthermore, when g is a solution of y″ + λ2y = 0 in (a – R, a + R), then g is such a function and (1.1) specializes to1.2In this note we generalize these results to the real Euclidean space EN, our conclusions being Theorems 1 and 2 below. Clearly, (1.2) is a special case of (1.1) but in higher-dimensional space it is of interest to allow g, now a solution of1.3to possess singularities at isolated points away from the origin. It is then necessary to consider not only a neighbourhood of the origin but annular regions also.


Sign in / Sign up

Export Citation Format

Share Document