Skip to content

Conversation

@manastole03
Copy link

@manastole03 manastole03 commented Dec 13, 2025

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

@google-cla
Copy link

google-cla bot commented Dec 13, 2025

Thanks for your pull request! It looks like this may be your first contribution to a Google open source project. Before we can look at your pull request, you'll need to sign a Contributor License Agreement (CLA).

View this failed invocation of the CLA check for more information.

For the most up to date status, view the checks section at the bottom of the pull request.

@manastole03
Copy link
Author

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.

@YaelDillies YaelDillies changed the title Add Erdős Problem #1088: Distinct Distances Conjecture in ℝᵈ feat(ErdosProblems): 1088, Distinct Distances Conjecture in ℝᵈ Dec 17, 2025
Comment on lines +42 to +49
@[category research open, AMS 51]
theorem erdos_1088_general :
(∀ d ≥ 1, ∀ n ≥ 1, ∃ m, ∀ S : Finset (ℝ^d), S.card = m → hasSubsetWithDistinctDistances n S)
↔ answer(sorry) := by
sorry

@[category research open, AMS 51]
theorem erdos_1088_exponential :
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Can you please document both conjectures in latex?

@YaelDillies YaelDillies added the awaiting-author The author should answer a question or perform changes. Reply when done. label Dec 20, 2025
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

awaiting-author The author should answer a question or perform changes. Reply when done.

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Erdős Problem 1088

2 participants