Related papers: A new progress on Weak Dirac conjecture

We show that there exists an absolute positive constant $b (\geq \frac{1}{48})$ so that any set of $n$ points in $\mathbb{R}^d$ that is $d$-dimensional determines at least $bdn$ lines with pairwise distinct directions. As a consequence we…

Let $\mathbb N_0$ be the set of non-negative integers, and let $P(n,l)$ denote the set of all weak compositions of $n$ with $l$ parts, i.e., $P(n,l)=\{ (x_1,x_2,\dots, x_l)\in\mathbb N_0^l\ :\ x_1+x_2+\cdots+x_l=n\}$. For any element…

We prove that in every metric space where no line contains all the points, there are at least $\Omega(n^{2/3})$ lines. This improves the previous $\Omega(\sqrt{n})$ lower bound on the number of lines in general metric space, and also…

In this paper we give an alternative, purely Conley index based proof of the Arnold conjecture in $\mathbb C\mathbb P^n$ asserting that a Hamiltonian diffeomorphism of $\mathbb C\mathbb P^n$ endowed with the Fubini-Study metric has at least…

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…

A finite set $P$ of points in the plane is $n$-universal with respect to a class $\mathcal{C}$ of planar graphs if every $n$-vertex graph in $\mathcal{C}$ admits a crossing-free straight-line drawing with vertices at points of $P$. For the…

Say that a subset S of the plane is a "circle-center set" if S is not a subset of a line, and whenever we choose three noncollinear points from S, the center of the unique circle through those three points is also an element of S. A problem…

It is proved that the Continuum Hypothesis implies that any sequence of rapid P-points of length $<{\mathfrak c}^{+}$ which is increasing with respect to the Rudin-Keisler ordering is bounded above by a rapid P-point. This is an improvement…

The distinct dot products problem, a variant of the Erd\H{o}s distinct distances problem, asks "Given a set $P_n$ of $n$ points in $\mathbb{R}^2$, what is the minimum number $|D(P_n)|$ of distinct dot products they determine?" The best…

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

In this paper we are concerned with the number of critical points of solutions of nonlinear elliptic equations. We will deal with the case of non-convex, contractile and non-contractile planar domains. We will prove results on the estimate…

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…

van Emde Boas (1981) conjectured that computing a shortest non-zero vector of a lattice in an Euclidean space is NP-hard. In this paper, we prove that this conjecture is true and hence de-randomize the classical randomness result of Ajtai…

The recent paper "A quantitative Doignon-Bell-Scarf Theorem" by Aliev et al. generalizes the famous Doignon-Bell-Scarf Theorem on the existence of integer solutions to systems of linear inequalities. Their generalization examines the number…

Given a rational $a=p/q$ and $N$ nonnegative $d$-dimensional real vectors $u_1$, ..., $u_N$, we show that it is always possible to choose $(d-1)+\lceil (pN-d+1)/q\rceil$ of them such that their sum is (componentwise) at least…

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

All sets of lines providing a partition of the set of internal points to a conic C in PG(2,q), q odd, are determined. There exist only three such linesets up to projectivities, namely the set of all nontangent lines to C through an external…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…