Related papers: Distinct distance estimates and low degree polynom…

We use the polynomial partitioning method of Guth to prove weighted Fourier restriction estimates in $\Bbb R^3$ with exponents $p$ that range between $3$ and $3.25$, depending on the weight. As a corollary to our main theorem, we obtain new…

In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…

Given two points $p,q$ in the real plane, the signed area of the rectangle with the diagonal $[pq]$ equals the square of the Minkowski distance between the points $p,q$. We prove that $N>1$ points in the Minkowski plane $\R^{1,1}$ generate…

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…

A well-known theorem in plane geometry states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite metric spaces,…

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

Let $\mathfrak{L}$ be a collection of $L$ lines in $\R^3$ and $J$ the set of joints formed by $\mathfrak{L}$, i.e. the set of points each of which lies in at least 3 non-coplanar lines of $\mathfrak{L}$. It is known that $|J| \lesssim…

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

If an n-side unit regular polygon is divided into m equal sized parts, then what is the minimum length of the split line ${l_{m,n}}$? This problem has its practical application in real world. This paper proved that ${l_{2,3}} = \sqrt…

We generalize to sets with cardinality more than $p$ a theorem of R\'edei and Sz\H{o}nyi on the number of directions determined by a subset $U$ of the finite plane $\mathbb F_p^2$. A $U$-rich line is a line that meets $U$ in at least…

We identify a new way to divide the $\delta$-neighborhood of surfaces $\mathcal{M}\subset\mathbb{R}^3$ into a finitely-overlapping collection of rectangular boxes $S$. We obtain a sharp $(l^2,L^p)$ decoupling estimate using this…

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…

Every set of points $\mathcal{P}$ determines $\Omega(|\mathcal{P}| / \log |\mathcal{P}|)$ distances. A close version of this was initially conjectured by Erd\H{o}s in 1946 and rather recently proved by Guth and Katz. We show that when near…

The aim of this paper is to prove that if a planar set $A$ has a difference set $\Delta(A)$ satisfying $\Delta(A)\subset \Z^++s$ for suitable $s$ than $A$ has at most 3 elements. This result is motivated by the conjecture that the disk has…

Main Result: Let $(M,L)$ be a smooth complex polarized threefold. Then the linear system $| K+tL|$ separates any two different points on $M$ for any $t\ge 6$, where $K$ is the canonical bundle of $M$. The argument in the proof is a variant…

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…