An asymptotically sharp estimate for the error term in this maximum is given for d \geq 4. Tight upper bounds are also determined for the total number of occurrences of what are called ``favourite'' distances from n points in Rd, d \geq 4. Some related results are also proved for distances determined by n disjoint compact convex sets in R2.
Reviewer: P.Smith (Keele)
Classif.: * 52C10 Erdoes problems and related topics of discrete geometry
52A10 Convex sets in 2 dimensions (including convex curves)
52A20 Convex sets in n dimensions
Keywords: repeated distances; points in Rd; convex sets
© European Mathematical Society & FIZ Karlsruhe & Springer-Verlag