Unit Distances and Diameters in Euclidean Spaces
نویسندگان
چکیده
منابع مشابه
Unit Distances and Diameters in Euclidean Spaces
We show that the maximum number of unit distances or of diameters in a set of n points in d-dimensional Euclidean space is attained only by specific types of Lenz constructions, for all d ≥ 4 and n sufficiently large, depending on d. As a corollary we determine the exact maximum number of unit distances for all even d ≥ 6, and the exact maximum number of diameters for all d ≥ 4, for all n suffi...
متن کاملDiameters of Homogeneous Spaces
Let G be a compact connected Lie group with trivial center. Using the action of G on its Lie algebra, we define an operator norm | |G which induces a bi-invariant metric dG(x, y) = |Ad(yx−1)|G on G. We prove the existence of a constant β ≈ .23 (independent of G) such that for any closed subgroup H ( G, the diameter of the quotient G/H (in the induced metric) is ≥ β.
متن کاملSpatial Analysis in curved spaces with Non-Euclidean Geometry
The ultimate goal of spatial information, both as part of technology and as science, is to answer questions and issues related to space, place, and location. Therefore, geometry is widely used for description, storage, and analysis. Undoubtedly, one of the most essential features of spatial information is geometric features, and one of the most obvious types of analysis is the geometric type an...
متن کاملBerkovich Spaces Embed in Euclidean Spaces
Let K be a eld that is complete with respect to a nonarchimedean absolute value such that K has a countable dense subset. We prove that the Berkovich analyti cation V an of any d-dimensional quasi-projective scheme V over K embeds in R. If, moreover, the value group of K is dense in R>0 and V is a curve, then we describe the homeomorphism type of V an by using the theory of local dendrites.
متن کاملUnit Distances in Three Dimensions
We show that the number of unit distances determined by n points in R is O(n), slightly improving the bound of Clarkson et al. [5], established in 1990. The new proof uses the recently introduced polynomial partitioning technique of Guth and Katz [12]. While this paper was still in a draft stage, a similar proof of our main result was posted to the arXiv by Joshua Zahl [25].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2008
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-008-9082-x