Related papers: A Non-Convex Separation Through an Alternative Pro…
We prove that for any collection F of $n \ge 2$ pairwise disjoint compact convex sets in the plane there is a pair of sets A and B in F such that any line that separates A from B separates either A or B from a subcollection of F with at…
In this short note we provide a new proof of the recent result of Han and Nashimura on the separation of spherical convex sets established in arXiv:2002.06558. Our proof is based on a result stated in locally convex spaces.
After surveying some known properties of compact convex sets in the plane, we give a two rigorous proofs of the general feeling that supporting lines can be slide-turned slowly and continuously. Targeting a wide readership, our treatment is…
A plank is the part of space between two parallel planes. The following open problem, posed 45 years ago, can be viwed as the converse of Tarski's plank problem (Bang's theorem): Is it true that if the total width of a collection of planks…
A topological hyperplane is a subspace of R^n (or a homeomorph of it) that is topologically equivalent to an ordinary straight hyperplane. An arrangement of topological hyperplanes in R^n is a finite set H such that k topological…
In this paper we establish a general framework in which the verification of support theorems for generalized convex functions acting between an algebraic structure and an ordered algebraic structure is still possible. As for the domain…
This paper contains a detailed, self contained and more streamlined proof of our $l^2$ decoupling theorem for hypersurfaces.
Several papers have been written studying unexpected hypersurfaces. We say a finite set of points Z admits unexpected hypersurfaces if a general union of fat linear subspaces imposes less that the expected number of conditions on the ideal…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
Let $K$ be a convex body in Euclidean space ${\mathbb R}^d$, and let a translation invariant, locally finite Borel measure on the space of hyperplanes in ${\mathbb R}^d$ be given. For $\delta\ge 0$, we consider the set of all points $x$ for…
It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…
In this article we prove in main Theorem A that any infinity type real hyperplane arrangement $\mathcal{H}_n^m$ (Definition 2.11) with the associated normal system $\mathcal{N}$ (Definitions [2.2,2.4] can be represented isomorphically…
In this article we prove in the main theorem that, there is a bijection between the isomorphism classes of a certain type of real hyperplane arrangements on the one hand, and the antipodal pairs of convex cones of an associated…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…
Recently, Kronqvist et al.~\cite{KronqvistLundellWesterlund2016} rediscovered the supporting hyperplane algorithm of Veinott~\cite{Veinott1967} and demonstrated its computational benefits for solving convex mixed-integer nonlinear programs.…
In this paper, two parallel notions of convexity of sets are introduced in the abelian semigroup setting. The connection of these notions to algebraic and to set-theoretic operations is investigated. A formula for the computation of the…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
Given a hypergraph $H$, the Planar Support problem asks whether there is a planar graph $G$ on the same vertex set as $H$ such that each hyperedge induces a connected subgraph of $G$. Planar Support is motivated by applications in graph…
This article is concerned with support theorems of the X-ray transform on non-compact manifolds with conjugate points. In particular, we prove that all simply connected 2-step nilpotent Lie groups have a support theorem. Important…