Related papers: Holes or Empty Pseudo-Triangles in Planar Point Se…

Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the Erd\H{o}s--Szekeres theorem is known and empty triangles have been investigated. We introduce a…

We prove that if a subset of $(\mathbb{F}_q^n)^k$ (with $q$ an odd prime power) avoids a full-rank three-point pattern $\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d}$ then it is exponentially small, having size at most $3 \cdot c_q^{nk}$…

We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…

We prove that if $E \subset {\mathbb F}_q^2$, $q \equiv 3 \mod 4$, has size greater than $Cq^{7/4}$, then $E$ determines a positive proportion of all congruence classes of triangles in ${\mathbb F}_q^2$. The approach in this paper is based…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

For positive integers $m$ and $n$, define $f(m,n)$ to be the smallest integer such that any subset $A$ of the $m \times n$ integer grid with $|A| \geq f(m,n)$ contains a rectangle; that is, there are $x\in [m]$ and $y \in [n]$ and…

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…

For a field $\mathbb{F}$ and integers $d, k$ and $\ell$, a set $A \subseteq \mathbb{F}^d$ is called $(k,\ell)$-nearly orthogonal if all vectors in $A$ are non-self-orthogonal and every $k+1$ vectors in $A$ contain $\ell + 1$ pairwise…

Let $S$ be a set of $n$ points in general position in the plane. The Second Selection Lemma states that for any family of $\Theta(n^3)$ triangles spanned by $S$, there exists a point of the plane that lies in a constant fraction of them.…

A {\em convex hole} (or {\em empty convex polygon)} of a point set $P$ in the plane is a convex polygon with vertices in $P$, containing no points of $P$ in its interior. Let $R$ be a bounded convex region in the plane. We show that the…

We introduce a class of Falconer distance problems, which we call of restricted type, lying between the classical version and its pinned variant. Prototypical restricted distance sets are the diagonal distance sets, $k$-point configuration…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

We compute the number of triangulations of a convex $k$-gon each of whose sides is subdivided by $r-1$ points. We find explicit formulas and generating functions, and we determine the asymptotic behaviour of these numbers as $k$ and/or $r$…

An $(n-1)$-tuple $a = (a(1), \dots, a(n-1))$ consisting of positive integers is said to be asymptotically hollow if there exist infinitely many positive integers $N$ such that the convex hull, $K(a(n))$, in $n$-dimensional Euclidean space…

The aperture angle alpha(x, Q) of a point x not in Q in the plane with respect to a convex polygon Q is the angle of the smallest cone with apex x that contains Q. The aperture angle approximation error of a compact convex set C in the…

Given a finite point set $P$ in the plane, a subset $S \subseteq P$ is called an island in $P$ if $conv(S) \cap P = S$. We say that $S\subset P$ is a visible island if the points in $S$ are pairwise visible and $S$ is an island in $P$. The…

Let $D$ be an orientation of a simple graph. Given $u,v\in V(D)$, a directed shortest $(u,v)$-path is a $(u,v)$-geodesic. $S \subseteq V(D)$ is convex if, for every $u,v \in S$, the vertices in each $(u,v)$-geodesic and in each…

Let $P$ be a set of points in general position in the plane. Join all pairs of points in $P$ with straight line segments. The number of segment-crossings in such a drawing, denoted by $\crg(P)$, is the \emph{rectilinear crossing number} of…

A recent breakthrough in computer-assisted mathematics showed that every set of $30$ points in the plane in general position (i.e., without three on a common line) contains an empty convex hexagon, thus closing a line of research dating…