On the diameter of separated point sets with many nearly equal distances
نویسندگان
چکیده
A point set is separated if the minimum distance between its elements is 1. We call two real numbers nearly equal if they differ by at most 1. We prove that for any dimension d ≥ 2 and any γ > 0, if P is a separated set of n points in Rd such that at least γ n2 pairs in ( P 2 ) determine nearly equal distances, then the diameter of P is at least C(d, γ )n2/(d−1) for some constant C(d, γ ) > 0. In the case of d = 3, this result confirms a conjecture of Erdős. The order of magnitude of the above bound cannot be improved for any d . c © 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Nearly Equal Distances in the Plane
distances determined by them? In particular, what is the maximum number of pairs of points that determine the same distance? Although a lot of progress has been made in this area, we are still very far from having satisfactory answers to the above questions (cf. [EP], [MP], [PA] for recent surveys). Two distances are said to be nearly the same if they differ by at most 1. If all points of a set...
متن کاملSeparated finitely supported $Cb$-sets
The monoid $Cb$ of name substitutions and the notion of finitely supported $Cb$-sets introduced by Pitts as a generalization of nominal sets. A simple finitely supported $Cb$-set is a one point extension of a cyclic nominal set. The support map of a simple finitely supported $Cb$-set is an injective map. Also, for every two distinct elements of a simple finitely supported $Cb$-set, there exists...
متن کاملOn Point Sets with Many Unit Distances in Few Directions
We study the problem of the maximum number of unit distances among n points in the plane under the additional restriction that we count only those unit distances that occur in a xed set of k directions taking the maximum over all sets of n points and all sets of k directions We prove that for xed k and su ciently large n n k the extremal sets are essentially sections of lattices bounded by edge...
متن کاملOn the minimum diameter of plane integral point sets
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets P , which are sets of n points in the plane with pairwise integral distances where not all the points are collinear. The largest occurring distance is called its diameter. Naturally the question about the minimum possible diameter d(2, n) of a plane integral point se...
متن کاملAn Artificial Neural Network Model for Predicting the Pressure Gradient in Horizontal Oil–Water Separated Flow
In this study, a three–layer artificial neural network (ANN) model was developed to predict the pressure gradient in horizontal liquid–liquid separated flow. A total of 455 data points were collected from 13 data sources to develop the ANN model. Superficial velocities, viscosity ratio and density ratio of oil to water, and roughness and inner diameter of pipe were used as input parameters of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 27 شماره
صفحات -
تاریخ انتشار 2006