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": [ |
| 4 | "discrete-geometry" |
| 5 | ], |
| 6 | "type": "construction", |
| 7 | "structure": "instances", |
| 8 | "verify": [ |
| 9 | "certificate" |
| 10 | ], |
| 11 | "instances": [ |
| 12 | "n = 11", |
| 13 | "n = 12", |
| 14 | "n = 13", |
| 15 | "n = 14", |
| 16 | "n = 15", |
| 17 | "n = 16" |
| 18 | ], |
| 19 | "metric": { |
| 20 | "name": "smallest triangle area", |
| 21 | "better": "higher" |
| 22 | }, |
| 23 | "cover": { |
| 24 | "file": "poster.webp" |
| 25 | }, |
| 26 | "image": "python:3.12-slim", |
| 27 | "data": "Public: every configuration is a text file in this repository.", |
| 28 | "checks": { |
| 29 | "verify": "checks/verify.sbatch" |
| 30 | }, |
| 31 | "approval": "maintainers" |
| 32 | } |