Related papers: Rational Distances with Rational Angles

Consider the regular $n$-simplex $\Delta_n$ - it is formed by the convex-hull of $n+1$ points in Euclidean space, with each pair of points being in distance exactly one from each other. We prove an exact bound on the width of $\Delta_n$…

In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…

In 1975, P. Erd\H{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph on $n$ vertices in which any two cycles are of different lengths. Let $f^{\ast}(n)$ be the maximum number of edges in a simple graph on…

A Euclidean noncrossing Steiner $(1+\epsilon)$-spanner for a point set $P\subset\mathbb{R}^2$ is a planar straight-line graph that, for any two points $a, b \in P$, contains a path whose length is at most $1+\epsilon$ times the Euclidean…

We obtain several sharp lower and upper bounds for the Euclidean operator radius of a pair of bounded linear operators defined on a complex Hilbert space. As applications of these bounds we deduce a chain of new bounds for the classical…

We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…

We confirm the following conjecture of Fekete and Woeginger from 1997: for any sufficiently large even number $n$, every set of $n$ points in the plane can be connected by a spanning tour (Hamiltonian cycle) consisting of straight-line…

Let $X$ be an algebraic variety, defined over the rationals. This paper gives upper bounds for the number of rational points on $X$, with height at most $B$, for the case in which $X$ is a curve or a surface. In the latter case one excludes…

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

For a triangle $\Delta$, let (P) denote the problem of the existence of points in the plane of $\Delta$, that are at rational distance to the 3 vertices of $\Delta$. Answer to (P) is known to be positive in the following situation: $\Delta$…

We consider intersections of n diagonal forms of degrees k 1 < $\bullet$ $\bullet$ $\bullet$ < kn, and we prove an asymptotic formula for the number of rational points of bounded height on these varieties. The proof uses the…

The three distance theorem states that for any given irrational number $\alpha$ and a natural number $n$, when the interval $( 0, 1 )$ is divided into $n+1$ subintervals by integer multiples of $\alpha$, namely, $\{0\}, \{ \alpha \}, \{…

We show that the number of unit-area triangles determined by a set of $n$ points in the plane is $O(n^{9/4+\epsilon})$, for any $\epsilon>0$, improving the recent bound $O(n^{44/19})$ of Dumitrescu et al.

We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with…

Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…

A well-known theorem of Erd\H{o}s and Gallai asserts that a graph with no path of length $k$ contains at most $\frac{1}{2}(k-1)n$ edges. Recently Gy\H{o}ri, Katona and Lemons gave an extension of this result to hypergraphs by determining…