Related papers: Convex polygons and separation of convex sets

We prove that if $E \subset {\Bbb F}_q^d$, $d \ge 2$, $F \subset \operatorname{Graff}(d-1,d)$, the set of affine $d-1$-dimensional planes in ${\Bbb F}_q^d$, then $|\Delta(E,F)| \ge \frac{q}{2}$ if $|E||F|>q^{d+1}$, where $\Delta(E,F)$ the…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We study a few approaches to identify inclusion (up to a shift) between two convex bodies in ${\mathbb R}^n$. To this goal we use mixed volumes and fractional linear maps. We prove that inclusion may be identified by comparing volume or…

Karasev conjectured that for any set of $3k$ lines in general position in the plane, which is partitioned into $3$ color classes of equal size $k$, the set can be partitioned into $k$ colorful 3-subsets such that all the triangles formed by…

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…

We show that, for any graph $F$ and $\eta>0$, there exists a $d_0=d_0(F,\eta)$ such that every $n$-vertex $d$-regular graph with $d \geq d_0$ has a collection of vertex-disjoint $F$-subdivisions covering at least $(1-\eta)n$ vertices. This…

Let $K$ be a compact convex set in $\mathbb{R}^2$ and let $\mathcal{F}_1, \mathcal{F}_2, \mathcal{F}_3$ be finite families of translates of $K$ such that $A \cap B \neq \emptyset$ for every $A \in \mathcal{F}_i$ and $B \in \mathcal{F}_j$…

Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…

A separating path system for a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that for every two edges $e$ and $f$ in $G$, there is a path in $\mathcal{P}$ that contains $e$ but not $f$. We show that every $n$-vertex graph has…

A line g is a transversal to a family F of convex polytopes in 3-dimensional space if it intersects every member of F. If, in addition, g is an isolated point of the space of line transversals to F, we say that F is a pinning of g. We show…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

In the paper ``Lower bounds on the number of crossing-free subgraphs of $K_N$'' (Computational Geometry 16 (2000), 211-221), it is shown that a double chain of $n$ points in the plane admits at least $\Omega(4.642126305^n)$ polygonizations,…

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

Given a homogenous Poisson point process in the plane, we prove that it is possible to partition the plane into bounded connected cells of equal volume, in a translation-invariant way, with each point of the process contained in exactly one…

In the first part of this note, we review results concerning analytic characterization of convexity for planar sets. The second part is devoted to results valid for arbitrary $m \ge 2$.

The set of chambers of a real hyperplane arrangement may be ordered by separation from some fixed chamber. When this poset is a lattice, Bjorner, Edelman, and Ziegler proved that the chambers are in natural bijection with the biconvex sets…

Deciding whether a family of disjoint line segments in the plane can be linked into a simple polygon (or a simple polygonal chain) by adding segments between their endpoints is NP-hard.

Let F be a foliation of codimension 2 on a compact manifold with at least one non-compact leaf. We show that then F must contain uncountably many non-compact leaves. We prove the same statement for oriented p-dimensional foliations of…

Let $G = V, E$ be a simple connected undirected graph. A set $X \subseteq V$ is \emph{geodesically convex} if for any pair of vertices $x, y \in X$, all vertices on all shortest paths in $G$ from $x$ to $y$ are contained in $X$. A set $H…