Distinct distances between a collinear set and an arbitrary set of points

DOI10.1016/J.DISC.2017.08.037zbMATH Open1378.51007arXiv1612.04940OpenAlexW2582801014MaRDI QIDQ2411627FDOQ2411627

Authors: Ariel Bruner, Micha Sharir 

Publication date: 24 October 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We consider the number of distinct distances between two finite sets of points in $$, for any constant dimension $kge2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary points, such that no hyperplane orthogonal to $l$ and no hypercylinder having $l$ as its axis contains more than $O(1)$ points of $P_2$. The number of distinct distances between $P_1$ and $P_2$ is then ${\displaystyle }$ Omegaleft(minleft{ n^{2/3}m^{2/3},; frac{n^{10/11}m^{4/11}}{log^{2/11}m},; n^2,; m^2 ight} ight) . ${\displaystyle }$ Without the assumption on $P_2$, there exist sets $P_1$, $P_2$ as above, with only $O(m+n)$ distinct distances between them.

Full work available at URL: https://arxiv.org/abs/1612.04940

Recommendations

• Distinct distances on two lines
• Distinct distances between points and lines
• Distinct distances between points and lines in \(\mathbb{F}_q^2\)
• On distinct distances between a variety and a point set
• Distinct distances in homogeneous sets

zbMATH Keywords

combinatorial geometrydistinct distancesincidences

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial geometries and geometric closure systems (51D20)

Cites Work

• Research Problems in Discrete Geometry
• On the Erdős distinct distances problem in the plane
• On Sets of Distances of n Points
• On some problems of elementary and combinatorial geometry
• Few distinct distances implies no heavy lines or circles
• A combinatorial problem on polynomials and rational functions
• Sets with few distinct distances do not have heavy lines
• Distinct Distances on Algebraic Curves in the Plane
• Lenses in arrangements of pseudo-circles and their applications
• Intersection reverse sequences and geometric applications.
• A note on the number of distinct distances
• Distinct distances on two lines
• Distinct distances on curves via rigidity

Cited In (8)

• Infinite cardinalities in the Hausdorff metric geometry
• Bisectors and pinned distances
• Distinct distances in \(\mathbf{R}^3\) between quadratic and orthogonal curves
• Distinct distances between points and lines in \(\mathbb{F}_q^2\)
• Distinct Distances Between a Circle and a Generic Set
• Distinct distance estimates and low degree polynomial partitioning
• Distinct distances in homogeneous sets in Euclidean space
• On Cartesian products which determine few distinct distances

This page was built for publication: Distinct distances between a collinear set and an arbitrary set of points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2411627)