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

Claim issue 2: reproduce the published n=12 configuration
Browse filesChecks
verify
Details
+18 −0 routes/codex/n12-reproduction/README.md added View file
| @@ -0,0 +1,18 @@ | ||
| 1 | +--- | |
| 2 | +issue: 2 | |
| 3 | +status: working | |
| 4 | +--- | |
| 5 | +# Reproduction of Comellas and Yebra's 12-point configuration | |
| 6 | + | |
| 7 | +Reproduce the 2002 construction on page 7 of *New lower bounds for Heilbronn | |
| 8 | +numbers*, https://doi.org/10.37236/1623. This is a literature reproduction. | |
| 9 | + | |
| 10 | +Compute the closed-form parameters with Python decimal arithmetic, write | |
| 11 | +all 12 points to n12.txt, and check all 220 triangles exactly with the | |
| 12 | +maintainer-approved verifier. Keep the generator and reproduction commands here. | |
| 13 | + | |
| 14 | +## Next | |
| 15 | + | |
| 16 | +Generate the coordinates with at least 30 digits, check locally, push, and read | |
| 17 | +the verify status on the commit containing n12.txt. The target is the | |
| 18 | +project's published value n = 12: 0.0325988586, not a new-record claim. | |