Skip to content

Link #1083 to A186704#295

Merged
teorth merged 1 commit into
teorth:mainfrom
arcoretx:link-1083-A186704
May 16, 2026
Merged

Link #1083 to A186704#295
teorth merged 1 commit into
teorth:mainfrom
arcoretx:link-1083-A186704

Conversation

@arcoretx

Copy link
Copy Markdown

Problem #1083 studies $f_d(n)$, the minimum number of distinct distances determined by $n$ points in $\mathbb{R}^d$, for $d \geq 3$.

A186704 "The minimum number of distinct distances determined by n points in the Euclidean plane" is the $d=2$ specialisation. Cross-referencing it on #1083 gives readers the lower-dimensional base case and ties the problem family together; A186704 already cites #89 (the $d=2$ form).

"possible" retained because the $d \geq 3$ values $f_d(n)$ are not currently in OEIS.

(AI-assisted; OEIS match is a known sequence, not a new submission.)

@teorth
teorth merged commit 65f8577 into teorth:main May 16, 2026
widefox pushed a commit to widefox/erdosproblems that referenced this pull request Jul 19, 2026
widefox pushed a commit to widefox/erdosproblems that referenced this pull request Jul 19, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants