A criterion for checking if a convex set belongs to the union of a finite number of convex sets

2009 ◽  
Vol 49 (9) ◽  
pp. 1499-1506
Author(s):  
D. G. Pivovarchuk
Keyword(s):  
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).


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$.


1970 ◽  
Vol 13 (2) ◽  
pp. 175-179 ◽  
Author(s):  
G. T. Sallee

In this paper we provide new proofs of some interesting results of Firey [2] on isoperimetric ratios of Reuleaux polygons. Recall that a Reuleaux polygon is a plane convex set of constant width whose boundary consists of a finite (odd) number of circular arcs. Equivalently, it is the intersection of a finite number of suitably chosen congruent discs. For more details, see [1, p. 128].If a Reuleaux polygon has n sides (arcs) of positive length (where n is odd and ≥ 3), we will refer to it as a Reuleaux n-gon, or sometimes just as an n-gon. If all of the sides are equal, it is termed a regular n-gon.


1996 ◽  
Vol 28 (02) ◽  
pp. 384-393 ◽  
Author(s):  
Lutz Dümbgen ◽  
Günther Walther

The Hausdorff distance between a compact convex set K ⊂ ℝd and random sets is studied. Basic inequalities are derived for the case of being a convex subset of K. If applied to special sequences of such random sets, these inequalities yield rates of almost sure convergence. With the help of duality considerations these results are extended to the case of being the intersection of a random family of halfspaces containing K.


1968 ◽  
Vol 20 ◽  
pp. 144-157 ◽  
Author(s):  
R. A. Brualdi
Keyword(s):  

In (8) M. V. Menon investigates the diagonal equivalence of a non-negative matrix A to one with prescribed row and column sums and shows that this equivalence holds provided there exists at least one non-negative matrix with these row and column sums and with zeros in exactly the same positions A has zeros. However, he leaves open the question of when such a matrix exists. W. B. Jurkat and H.J. Ryser in (7) study the convex set of all m × n non-negative matrices having given row and column sums.


1985 ◽  
Vol 17 (02) ◽  
pp. 308-329 ◽  
Author(s):  
D. G. Kendall

The paper starts with a simple direct proof that . A new formula is given for the shape-density for a triangle whose vertices are i.i.d.-uniform in a compact convex set K, and an exact evaluation of that shape-density is obtained when K is a circular disk. An (x, y)-diagram for an auxiliary shape-density is then introduced. When K = circular disk, it is shown that is virtually constant over a substantial region adjacent to the relevant section of the collinearity locus, large enough to contain the work-space for most collinearity studies, and particularly appropriate when the ‘strip’ method is used to assess near-collinearity.


2002 ◽  
Vol 53 (3-4) ◽  
pp. 245-248
Author(s):  
Subir K. Bhandari ◽  
Ayanendranath Basu

Pitt's conjecture (1977) that P( A ∩ B) ≥ P( A) P( B) under the Nn (0, In) distribution of X, where A, B are symmetric convex sets in IRn still lacks a complete proof. This note establishes that the above result is true when A is a symmetric rectangle while B is any symmetric convex set, where A, B ∈ IRn. We give two different proofs of the result, the key component in the first one being a recent result by Hargé (1999). The second proof, on the other hand, is based on a rather old result of Šidák (1968), dating back a period before Pitt's conjecture.


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.


Author(s):  
ALAIN DAURAT

The Q-convexity is a kind of convexity in the discrete plane. This notion has practically the same properties as the usual convexity: an intersection of two Q-convex sets is Q-convex, and the salient points can be defined like the extremal points. Moreover a Q-convex set is characterized by its salient point. The salient points can be generalized to any finite subset of ℤ2.


Sign in / Sign up

Export Citation Format

Share Document