Related papers: Uniform distribution and geometric incidence theor…

In 1959, Erd\H{o}s and Moser asked for the maximum number of unit distances that may be formed among the vertices of a convex $n$-gon; until now, the best known upper bound has been $2\pi n \log_2 n + O(n)$, achieved by F\"uredi in 1990. In…

We prove that the number of unit distances among $n$ planar points is at most $1.94\cdot n^{4/3}$, improving on the previous best bound of $8n^{4/3}$. We also give better upper and lower bounds for several small values of $n$. We also prove…

Uniform measures have played a fundamental role in geometric measure theory since they naturally appear as tangent objects. For instance, they were essential in the groundbreaking work of Preiss on the rectifiability of Radon measures.…

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…

Incidence problems between geometric objects is a key area of focus in the field of discrete geometry. Among them, the study of incidence problems over finite fields have received a considerable amount of attention in recent years. In this…

We prove bounds on approximate incidences between families of circles and families of points in the plane. As a consequence, we prove a lower bound for the dimension of circular $(u,v)$-Furstenberg sets, which is new for large $u$ and $v$.

Let $p_1,\ldots,p_n$ be a set of points in the unit square and let $T_1,\ldots,T_n$ be a set of $\delta$-tubes such that $T_j$ passes through $p_j$. We prove a lower bound for the number of incidences between the points and tubes under a…

The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as…

Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…

We discuss a unified approach to a class of geometric combinatorics incidence problems in $2D$, of the Erd\"os distance type. The goal is obtaining the second moment estimate, that is given a finite point set $S$ and a function $f$ on…

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

An $(n_3)$ configuration is an incidence structure equivalent to a linear hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly…

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…

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…

A folklore conjecture asserts the existence of a constant $c_n > 0$ such that $\#\mathcal{F}_n(X) \sim c_n X$ as $X\to \infty$, where $\mathcal{F}_n(X)$ is the set of degree $n$ extensions $K/\mathbb{Q}$ with discriminant bounded by $X$.…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

We consider the 2-dimensional random matching problem in $\mathbb{R}^2.$ In a challenging paper, Caracciolo et. al. arXiv:1402.6993 on the basis of a subtle linearization of the Monge Ampere equation, conjectured that the expected value of…

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…