Distances on the tropical line determined by two points
نویسندگان
چکیده
منابع مشابه
Distances on the tropical line determined by two points
Let p′ and q′ be points in R. Write p′ ∼ q′ if p′ − q′ is a multiple of (1, . . . , 1). Two different points p and q in R/ ∼ uniquely determine a tropical line L(p, q) passing through them and stable under small perturbations. This line is a balanced unrooted semi–labeled tree on n leaves. It is also a metric graph. If some representatives p′ and q′ of p and q are the first and second columns o...
متن کاملThe Number of Different Distances Determined by a Set of Points in the Euclidean Plane
In 1946 P. Erdrs posed the problem of determining the minimum number d(n) of different distances determined by a set of n points in the Euclidean plane. Erdrs proved d(n) > 1/z _ cn and conjectured that d(n) > c n / l x / ~ n. If true, this inequality is best possible as is shown by the lattice points in the plane. We show d(n) > n'*/S/(log n) c.
متن کاملThe Number of Different Distances Determined by n Points in the Plane
A classical problem in combinatorial geometry is that of determining the minimum number f(n) of different distances determined by n points in the Euclidean plane. In 1952, L. Moser proved thatf(n) > n " '/(2 fi)-1 and this has remained for 30 years as the best lower bound known for f(n). It is shown that f(n) > cn " ' for some fixed constant c.
متن کاملPenrose patterns are almost entirely determined by two points
De Bruijn, N.G., Penrose patterns are almost entirely determined by two points, Discrete Mathematics 106/107 (1992) 97-104. It is shown that for any Penrose pattern ?r and for any positive number E we can find two vertices P and Q of n such that in any large circular disk all but a fraction of at most E of the vertices is common to all Penrose patterns (with the same pieces, in the same directi...
متن کاملDistinct Distances Between Sets of Points on a Line and a Hyperplane in R
A variant of Erdős’s distinct distances problem considers two sets of points in Euclidean space P1 and P2, both of cardinality n, and asks whether we can find a superlinear bound on the number of distinct distances between all pairs of points with one in P1 and the other in P2. In 2013, Sharir, Sheffer, and Solymosi [8] showed a lower bound of Ω(n) when P1 and P2 are both collinear point sets i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kybernetika
سال: 2014
ISSN: 0023-5954,1805-949X
DOI: 10.14736/kyb-2014-3-0408