This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean space. It contains a detailed account of existing results, given either chronologically or in related groups, and exhibits them in a uniform way, including terminology and notation. We first discuss classical Minkowski’s theorems on support and separation of convex bodies, and next describe various generalizations of these results to the case of arbitrary convex sets, which concern bounding and asymptotic hyperplanes, and various types of separation by hyperplanes, slabs, and complementary convex sets
Abstract. We say that a convex set K in Rd strictly separates the set A from the set B if A ⊂ int(K)...
In this paper, we present the necessary and sufficient conditions of two finite classes of samples t...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
AbstractThis is the second of a series of three papers dealing with convexity spaces. In the first p...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
AbstractIn this note we study the separation of two convex sets in the straight line spaces introduc...
For a given collection H of subsets of a set X we examine the convexity on X generated by H. We use ...
In this article we consider a separation technique proposed in J. Grzybowski, D. Pallaschke, and R. ...
In this article we consider a separation technique proposed in J. Grzybowski, D. Pallaschke, and R. ...
AbstractWe give some sufficient conditions of separation of two sets of integer points by a hyperpla...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
AbstractThis is the second of a series of three papers dealing with convexity spaces. In the first p...
The notion of convex set for subsets of lattices in one particular case was introduced in [1], where...
Abstract. We say that a convex set K in Rd strictly separates the set A from the set B if A ⊂ int(K)...
In this paper, we present the necessary and sufficient conditions of two finite classes of samples t...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...
This is a survey on support and separation properties of convex sets in the n-dimensional Euclidean ...
AbstractThis is the second of a series of three papers dealing with convexity spaces. In the first p...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
AbstractIn this note we study the separation of two convex sets in the straight line spaces introduc...
For a given collection H of subsets of a set X we examine the convexity on X generated by H. We use ...
In this article we consider a separation technique proposed in J. Grzybowski, D. Pallaschke, and R. ...
In this article we consider a separation technique proposed in J. Grzybowski, D. Pallaschke, and R. ...
AbstractWe give some sufficient conditions of separation of two sets of integer points by a hyperpla...
We prove new theorems which describe a necessary and sufficient condition for linear (strong and non...
AbstractThis is the second of a series of three papers dealing with convexity spaces. In the first p...
The notion of convex set for subsets of lattices in one particular case was introduced in [1], where...
Abstract. We say that a convex set K in Rd strictly separates the set A from the set B if A ⊂ int(K)...
In this paper, we present the necessary and sufficient conditions of two finite classes of samples t...
Abstract The Minkowski condition for convex polytopes is equivalent to the divergence theorem of cla...