Spreading points evenly: the max-to-min distance ratio
Place n points to minimize the ratio of the largest to the smallest distance; exact values in the plane are known only up to n = 8.
File it in the catalog (shoal-catalog 0521c19bbd38)
Browse files+24 −0 scienceslack.json added View file
| @@ -0,0 +1,24 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "mathematics", | |
| 3 | + "topics": [ | |
| 4 | + "discrete-geometry" | |
| 5 | + ], | |
| 6 | + "type": "construction", | |
| 7 | + "also": [ | |
| 8 | + "proof" | |
| 9 | + ], | |
| 10 | + "cover": { | |
| 11 | + "motif": "points", | |
| 12 | + "n": 12 | |
| 13 | + }, | |
| 14 | + "source": { | |
| 15 | + "key": "alphaevolve", | |
| 16 | + "name": "AlphaEvolve Repository of Problems", | |
| 17 | + "url": "https://google-deepmind.github.io/alphaevolve_repository_of_problems/problems/50.html", | |
| 18 | + "id": "50", | |
| 19 | + "curator": "Google DeepMind", | |
| 20 | + "status": "open", | |
| 21 | + "as_of": "2026-10-20", | |
| 22 | + "catalog": "0521c19bbd38" | |
| 23 | + } | |
| 24 | +} | |