feat(ErdosProblems): 1088, Distinct Distances Conjecture in ℝᵈ #1386
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This PR adds Erdős Problem #1088, an open conjecture related to distinct distances among points in high-dimensional Euclidean space.
The problem defines a function that measures the minimum number of points required so that any such set contains a subset of points where all pairwise distances are different. The conjecture asks for estimates of this function and whether it grows subexponentially with respect to the dimension when the number of points is fixed.
Status: Open
Reference: https://www.erdosproblems.com/1088
This contribution helps expand the repository’s coverage of open Erdős problems and makes this conjecture available for future discussion and exploration.
Closes #1288