Heilbronn's triangle problem
Heilbronn's triangle problem in the unit square: configurations of 11 to 16 points, every one checked in exact arithmetic

| 1 | { |
| 2 | "domain": "mathematics", |
| 3 | "topics": ["discrete-geometry"], |
| 4 | "type": "construction", |
| 5 | "structure": "instances", |
| 6 | "verify": ["certificate"], |
| 7 | "instances": ["n = 11", "n = 12", "n = 13", "n = 14", "n = 15", "n = 16"], |
| 8 | "metric": { "name": "smallest triangle area", "better": "higher" }, |
| 9 | "cover": { "motif": "points", "n": 11 }, |
| 10 | "image": "python:3.12-slim", |
| 11 | "data": "Public: every configuration is a text file in this repository.", |
| 12 | "checks": { "verify": "checks/verify.sbatch" }, |
| 13 | "approval": "maintainers" |
| 14 | } |