Lines, betweenness and metric spaces

From MaRDI portal
Publication:312159

DOI10.1007/S00454-016-9806-2zbMATH Open1364.51007arXiv1412.8283OpenAlexW1885355001MaRDI QIDQ312159FDOQ312159


Authors: Pierre Aboulker, Xiaomin Chen, Guangda Huzhang, Rohan Kapadia, Cathryn Supko Edit this on Wikidata


Publication date: 14 September 2016

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: A classic theorem of Euclidean geometry asserts that any noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chv'atal conjectured that this holds for an arbitrary finite metric space, with a certain natural definition of lines in a metric space. We prove that in any metric space with n points, either there is a line containing all the points or there are at least Omega(sqrtn) lines. This is the first polynomial lower bound on the number of lines in general finite metric spaces. In the more general setting of pseudometric betweenness, we prove a corresponding bound of Omega(n2/5) lines. When the metric space is induced by a connected graph, we prove that either there is a line containing all the points or there are Omega(n4/7) lines, improving the previous Omega(n2/7) bound. We also prove that the number of lines in an n-point metric space is at least n/5w, where w is the number of different distances in the space, and we give an Omega(n4/3) lower bound on the number of lines in metric spaces induced by graphs with constant diameter, as well as spaces where all the positive distances are from {1, 2, 3}.


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




Recommendations




Cites Work


Cited In (21)





This page was built for publication: Lines, betweenness and metric spaces

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