Distances among Point Sets in R^2 and R^3
Statement
For a point set in , let be the number of unit-distance point pairs: and let be the maximum over all sets of points: Further, let denote the number of distinct distances induced by a set of points : and let be the minimum over all sets of points: Give upper and lower bounds on and , particularly for and .
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.