Related papers: Non-Convexity
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
A set of reals A={a_1,...,a_2} is called convex if a_{i+1} - a_i > a_i - a_{i-1} for all i. We prove, in particular, that |A-A| \gg |A|^{8/5} \log{-2/5} |A|.
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not completely determine the triangulation. We show that even if…
A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in…
The main result is a direct proof of the implication $(LVKF_{k,3})\Rightarrow( LT_{3k-1,3})$ below. Consider the following statements: ($LVKF_{1,3}$) From any 11 points in $ \mathbb{R}^{3}$ one can choose 3 pairwise disjoint triples whose…
A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…
We study the relationship between the masses and the geometric properties of central configurations. We prove that in the planar four-body problem, a convex central configuration is symmetric with respect to one diagonal if and only if the…
For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…
A family of sets is said to be symmetric if its automorphism group is transitive, and $3$-wise intersecting if any three sets in the family have nonempty intersection. Frankl conjectured in 1981 that if $\mathcal{A}$ is a symmetric $3$-wise…
Nonsingular projective varieties which are both convex and rationally connected are considered. We ask whether such varieties must be algebraic homogeneous spaces G/P. In case X is a complete intersection, an affirmative answer is obtained…
The primary objective of this paper is to investigate the notions of geometric and sequential convexity within a graph-theoretic framework, with the aim of examining various structural properties and exploring the connection between these…
Let $D$ be a strongly connected digraphs on $n\ge 4$ vertices. A vertex $v$ of $D$ is noncritical, if the digraph $D-v$ is strongly connected. We prove, that if sum of the degrees of any two adjacent vertices of $D$ is at least $n+1$, then…
Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…
A simple closed curve $\gamma$ in the real projective plane $P^2$ is called anti-convex if for each point $p$ on the curve, there exists a line which is transversal to the curve and meets the curve only at $p$. We shall prove the relation…
In the convex set of all $3\ot 3$ states with positive partial transposes, we show that one can take two extreme points whose convex combinations belong to the interior of the convex set. Their convex combinations may be even in the…
When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…
Let V be a finite set and M a collection of subsets of V. Then M is an alignment of V if and only if M is closed under taking intersections and contains both V and the empty set. If M is an alignment of V, then the elements of M are called…
The union-closed sets conjecture (Frankl's conjecture) says that for any finite union-closed family of finite sets, other than the family consisting only of the empty set, there exists an element that belongs to at least half of the sets in…
We prove that every finite family of convex sets in the plane satisfying the $(4,3)$-property can be pierced by $9$ points. This improves the bound of $13$ proved by Gy\'arf\'as, Kleitman, and T\'oth in 2001.