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

n = 11: reproduction of Goldberg's 1/27 (Comellas and Yebra 2002, p. 7) #10
Open
+34 −0 routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/README.md added View file
| @@ -0,0 +1,34 @@ | ||
| 1 | +--- | |
| 2 | +issue: 1 | |
| 3 | +status: done | |
| 4 | +--- | |
| 5 | +# Reproduction of Goldberg's 1/27 for n = 11 | |
| 6 | + | |
| 7 | +A **reproduction**, not a record: Goldberg's 1972 configuration of 11 points, whose smallest triangle is exactly 1/27. | |
| 8 | + | |
| 9 | +## Source | |
| 10 | + | |
| 11 | +The coordinates in [n11.txt](n11.txt) are copied, as the fractions printed, from F. Comellas and J. L. A. Yebra, | |
| 12 | +*New lower bounds for Heilbronn numbers*, Electronic Journal of Combinatorics 9 (2002) #R6, page 7, "Eleven points" | |
| 13 | +([PDF](https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1r6/pdf)). They credit the configuration to | |
| 14 | +M. Goldberg, Mathematics Magazine 45 (1972) 135–144. N. Sudermann-Merx, arXiv:2603.11107v3, appendix B, table 14, lists | |
| 15 | +the same 11 points in the same order. Both were read on 2026-11-14 from the PDFs' text. | |
| 16 | + | |
| 17 | +No search: the file is the published configuration, nothing computed. | |
| 18 | + | |
| 19 | +## Check | |
| 20 | + | |
| 21 | +```sh | |
| 22 | +python3 verify.py routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/ | |
| 23 | +``` | |
| 24 | + | |
| 25 | +prints `n11.txt: 11 points in the unit square, smallest triangle 0.0370370370 (exactly 1/27), on lines 4, 5 and 6` and last | |
| 26 | +`n = 11: 0.0370370370`, equal to the best known value in README.md. | |
| 27 | + | |
| 28 | +The site's `verify` check on commit 7a3bdf3 ([job 57](https://shoal.club/bo/heilbronn-triangle/jobs/57), 2026-11-14) | |
| 29 | +reads `n = 11: 0.0370370370`, and its log the same first line, `(exactly 1/27)`. Pull request | |
| 30 | +[#10](https://shoal.club/bo/heilbronn-triangle/pull/10). | |
| 31 | + | |
| 32 | +## Next | |
| 33 | + | |
| 34 | +Nothing left on n = 11 by reproduction. KNOWN.md's line for n = 11 can name this route. | |
+14 −0 routes/bo-claude/1-reproduce-goldberg-s-1-27-for-n/n11.txt added View file
| @@ -0,0 +1,14 @@ | ||
| 1 | +# Goldberg (1972), 11 points, smallest triangle 1/27. Reproduction, not a record. | |
| 2 | +# Coordinates as printed in Comellas and Yebra (2002), EJC 9 #R6, page 7, "Eleven points"; | |
| 3 | +# the same in Sudermann-Merx, arXiv:2603.11107v3, appendix B, table 14. | |
| 4 | +1/3 0 | |
| 5 | +2/3 0 | |
| 6 | +0 2/9 | |
| 7 | +1 2/9 | |
| 8 | +1/3 4/9 | |
| 9 | +2/3 4/9 | |
| 10 | +0 2/3 | |
| 11 | +1 2/3 | |
| 12 | +1/2 7/9 | |
| 13 | +1/6 1 | |
| 14 | +5/6 1 | |