相关论文: Many unit distances requires many directions

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…

We generalize work of Erdos and Fishburn to study the structure of finite point sets that determine few distinct triangles. Specifically, we ask for a given $t$, what is the maximum number of points that can be placed in the plane to…

We prove that most one-dimensional projections of a discrete subset of a plane are either dense in R (the real line), or form a discrete subset of R. More precisely, the set E of exceptional directions (for which the indicated dichotomy…

An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.

An O'Nan configuration in a unital is a set of four lines forming a quadrilateral, where the six intersections of pairs of lines are points of the unital. In 2019 Feng and Li elegantly construct O'Nan configurations in Buekenhout-Metz…

We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…

The Separation Problem asks for the minimum number s(O,K) of hyperplanes required to strictly separate any interior point O of a convex body K from all faces of K. The Conjecture is s(O,K) is at most 2 to the power d in real d-space , and…

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

The aim of this article is to define and compare several distances (or metrics) between operators acting on different (separable) Hilbert spaces. We consider here three main cases of how to measure the distance between two bounded…

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 prove that if a finite point set in real space does not have too many points on a plane, then it spans a quadratic number of ordinary lines. This answers the real case of a question of Basit, Dvir, Saraf, and Wolf. It shows that there is…

In 1982, Ungar proved that the connecting lines of a set of $n$ noncollinear points in the plane determine at least $2\lfloor n/2 \rfloor$ directions (slopes). Sets achieving this minimum for $n$ odd (even) are called…

Motivated by automated junction recognition in tracking data, we study a problem of placing a square or disc of fixed size in an arrangement of lines or line segments in the plane. We let distances among the intersection points of the lines…

We introduce a novel definition of orientation on the triples of a family of pairwise intersecting planar convex sets and study its properties. In particular, we compare it to other systems of orientations on triples that satisfy a…

We investigate spherical 4-distance 7-designs by studying their distance distributions. We compute these distance distributions and use their product (an integer) to derive certain divisibility conditions relating the dimension $n$ and the…

The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…

The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…