On the Minkowski distances and products of sum sets

From MaRDI portal
Publication:891173

DOI10.1007/S11856-015-1227-ZzbMATH Open1378.52019arXiv1203.6237OpenAlexW1951200215MaRDI QIDQ891173FDOQ891173


Authors: Oliver Roche-Newton, Misha Rudnev Edit this on Wikidata


Publication date: 16 November 2015

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Abstract: 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 R1,1 generate Omega(fracNlogN) distinct distances, or all the distances are zero. The proof follows the lines of the Elekes/Sharir/Guth/Katz approach to the ErdH os distance problem, analysing the 3D incidence problem, arising by considering the action of the Minkowski isometry group ISO(1,1). The signature of the metric creates an obstacle to applying the Guth/Katz incidence theorem to the 3D problem at hand, since one may encounter a high count of congruent line intervals, lying on null lines, or "light cones", all these intervals having zero Minkowski length. In terms of the Guth/Katz theorem, its condition of the non-existence of "rich planes" generally gets violated. It turns out, however, that one can efficiently identify and discount incidences, corresponding to null intervals and devise a counting strategy, where the rich planes condition happens to be just ample enough for the strategy to succeed. As a corollary we establish the following near-optimal sum-product type estimate for finite sets A,BsubsetR, with more than one element: |(Apm{B})cdot{(Apm{B})}|gg{frac{|A||B|}{log{|A|}+log{|B|}}}.


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




Recommendations



Cites Work


Cited In (28)





This page was built for publication: On the Minkowski distances and products of sum sets

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