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

Reproduce the published n=12 configuration at 60 decimal places
Browse filesChecks
verify
Details
+68 −8 routes/codex/n12-reproduction/README.md View file
| @@ -4,15 +4,75 @@ status: working | ||
| 4 | 4 | --- |
| 5 | 5 | # Reproduction of Comellas and Yebra's 12-point configuration |
| 6 | 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. | |
| 7 | +This route reproduces the published construction to the project's ten decimal | |
| 8 | +places. It is not a new record or a proof of optimality. | |
| 9 | 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. | |
| 10 | +## Source and construction | |
| 11 | + | |
| 12 | +F. Comellas and J. L. A. Yebra, *New lower bounds for Heilbronn numbers*, | |
| 13 | +Electronic Journal of Combinatorics 9 (2002), R6, page 7, "Twelve points": | |
| 14 | +[article](https://doi.org/10.37236/1623), | |
| 15 | +[PDF](https://www.combinatorics.org/ojs/index.php/eljc/article/download/v9i1r6/pdf/). | |
| 16 | +Accessed 2026-11-12; the formula and coordinate table were also checked visually | |
| 17 | +on the original PDF page. | |
| 18 | + | |
| 19 | +Write t = (27 + 3 sqrt(57))^(1/3), x = 1 - (t^2 + 6)/(6t), | |
| 20 | +and y = 2x^2 - 3x + 1/2. The 12 points are, in the paper's order: | |
| 21 | +(x,0), (1-x,0), (0,x), (1,x), (1/2,y), (y,1/2), (1-y,1/2), | |
| 22 | +(1/2,1-y), (0,1-x), (1,1-x), (x,1), (1-x,1). | |
| 23 | + | |
| 24 | +`generate.py` uses Python's standard-library Decimal with 100 significant digits | |
| 25 | +for its default output, Newton iteration for the positive cube root, and 60 | |
| 26 | +digits after the decimal point for each coordinate. It never uses binary floats | |
| 27 | +to calculate coordinates. This is deterministic evaluation of the published | |
| 28 | +formula, not a search; a seed does not apply. | |
| 29 | + | |
| 30 | +## Reproduce and check | |
| 31 | + | |
| 32 | +From the repository root, with Python 3 and no extra dependencies: | |
| 33 | + | |
| 34 | +```sh | |
| 35 | +python3 routes/codex/n12-reproduction/generate.py > routes/codex/n12-reproduction/n12.txt | |
| 36 | +python3 verify.py routes/codex/n12-reproduction/ | |
| 37 | +``` | |
| 38 | + | |
| 39 | +Local run on 2026-11-12, Python 3.9.6: generation took less than 0.001 seconds. | |
| 40 | +The unchanged project verifier enumerated all 220 triangles with exact rational | |
| 41 | +arithmetic and printed: | |
| 42 | + | |
| 43 | +```text | |
| 44 | +n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 5 and 7 | |
| 45 | +n = 12: 0.0325988586 | |
| 46 | +``` | |
| 47 | + | |
| 48 | +`n12.txt` SHA-256: | |
| 49 | +`fec1694bab8c1864318ae2f83928aca6b871b94a7b03721202a59e32945f2a43`. | |
| 50 | +Regenerating the file reproduced its bytes exactly. The submitted decimal points | |
| 51 | +are rational approximations to irrational coordinates; the exact check is of | |
| 52 | +these submitted rationals. Matching ten displayed decimals does not assert exact | |
| 53 | +equality with the algebraic construction's area. | |
| 54 | + | |
| 55 | +## Precision experiment and limitations | |
| 56 | + | |
| 57 | +The same generator, changing only `--digits`, gave these exact-check displays: | |
| 58 | + | |
| 59 | +| Decimal places | Smallest triangle, cut to ten decimals | | |
| 60 | +| --- | --- | | |
| 61 | +| 6 | 0.0325987100 | | |
| 62 | +| 10 | 0.0325988586 | | |
| 63 | +| 30 | 0.0325988586 | | |
| 64 | +| 60 (submitted) | 0.0325988586 | | |
| 65 | + | |
| 66 | +Six-decimal output is valid but misses the reproduction target. Ten decimals | |
| 67 | +already match its displayed value in this run; 60 are retained to preserve a much | |
| 68 | +closer approximation. Rounding also changes which near-tied triangle is smallest. | |
| 69 | +The logs and generation timings are in `reproduction.json`. Only `n12.txt` is | |
| 70 | +submitted as the route's configuration; the lower-precision files were temporary. | |
| 13 | 71 | |
| 14 | 72 | ## Next |
| 15 | 73 | |
| 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. | |
| 74 | +Read the remote verify status on the commit holding these coordinates. If it | |
| 75 | +reports n = 12: 0.0325988586, submit this reproduction for maintainer review; the | |
| 76 | +maintainer can then use the verified route as evidence for the n = 12 entry in | |
| 77 | +KNOWN.md. Improving the published value would be a separate search, not a result | |
| 78 | +of this reproduction. | |
+45 −0 routes/codex/n12-reproduction/generate.py added View file
| @@ -0,0 +1,45 @@ | ||
| 1 | +#!/usr/bin/env python3 | |
| 2 | +"""Reproduce Comellas--Yebra (2002), page 7, using only decimal arithmetic. | |
| 3 | + | |
| 4 | +Source: https://doi.org/10.37236/1623 | |
| 5 | +Usage: python3 generate.py [--digits 60] > n12.txt | |
| 6 | +No search or random seed: the points are the published construction. | |
| 7 | +""" | |
| 8 | +import argparse | |
| 9 | +from decimal import Decimal, localcontext | |
| 10 | + | |
| 11 | + | |
| 12 | +def coordinates(digits): | |
| 13 | + with localcontext() as context: | |
| 14 | + context.prec = digits + 40 | |
| 15 | + a = Decimal(27) + 3 * Decimal(57).sqrt() | |
| 16 | + # t is the positive cube root of 27 + 3 sqrt(57). | |
| 17 | + t = Decimal(4) | |
| 18 | + tolerance = Decimal(10) ** -(context.prec - 8) | |
| 19 | + for _ in range(200): | |
| 20 | + next_t = (2 * t + a / (t * t)) / 3 | |
| 21 | + if abs(next_t - t) < tolerance: | |
| 22 | + t = next_t | |
| 23 | + break | |
| 24 | + t = next_t | |
| 25 | + else: | |
| 26 | + raise ArithmeticError("cube-root iteration did not converge") | |
| 27 | + x = 1 - (t * t + 6) / (6 * t) | |
| 28 | + y = 2 * x * x - 3 * x + Decimal("0.5") | |
| 29 | + zero, half, one = Decimal(0), Decimal("0.5"), Decimal(1) | |
| 30 | + points = [ | |
| 31 | + (x, zero), (one - x, zero), (zero, x), (one, x), | |
| 32 | + (half, y), (y, half), (one - y, half), (half, one - y), | |
| 33 | + (zero, one - x), (one, one - x), (x, one), (one - x, one), | |
| 34 | + ] | |
| 35 | + return "".join(f"{px:.{digits}f} {py:.{digits}f}\n" for px, py in points) | |
| 36 | + | |
| 37 | + | |
| 38 | +if __name__ == "__main__": | |
| 39 | + parser = argparse.ArgumentParser(description=__doc__) | |
| 40 | + parser.add_argument("--digits", type=int, default=60, | |
| 41 | + help="digits after the decimal point (default: 60)") | |
| 42 | + args = parser.parse_args() | |
| 43 | + if not 1 <= args.digits <= 1000: | |
| 44 | + parser.error("--digits must be between 1 and 1000") | |
| 45 | + print(coordinates(args.digits), end="") | |
+12 −0 routes/codex/n12-reproduction/n12.txt added View file
| @@ -0,0 +1,12 @@ | ||
| 1 | +0.115353822880684292379795267832483253664723477050571497883447 0.000000000000000000000000000000000000000000000000000000000000 | |
| 2 | +0.884646177119315707620204732167516746335276522949428502116553 0.000000000000000000000000000000000000000000000000000000000000 | |
| 3 | +0.000000000000000000000000000000000000000000000000000000000000 0.115353822880684292379795267832483253664723477050571497883447 | |
| 4 | +1.000000000000000000000000000000000000000000000000000000000000 0.115353822880684292379795267832483253664723477050571497883447 | |
| 5 | +0.500000000000000000000000000000000000000000000000000000000000 0.180551540264323688817323281079514069763207453810125325438931 | |
| 6 | +0.180551540264323688817323281079514069763207453810125325438931 0.500000000000000000000000000000000000000000000000000000000000 | |
| 7 | +0.819448459735676311182676718920485930236792546189874674561069 0.500000000000000000000000000000000000000000000000000000000000 | |
| 8 | +0.500000000000000000000000000000000000000000000000000000000000 0.819448459735676311182676718920485930236792546189874674561069 | |
| 9 | +0.000000000000000000000000000000000000000000000000000000000000 0.884646177119315707620204732167516746335276522949428502116553 | |
| 10 | +1.000000000000000000000000000000000000000000000000000000000000 0.884646177119315707620204732167516746335276522949428502116553 | |
| 11 | +0.115353822880684292379795267832483253664723477050571497883447 1.000000000000000000000000000000000000000000000000000000000000 | |
| 12 | +0.884646177119315707620204732167516746335276522949428502116553 1.000000000000000000000000000000000000000000000000000000000000 | |
+29 −0 routes/codex/n12-reproduction/reproduction.json added View file
| @@ -0,0 +1,29 @@ | ||
| 1 | +{ | |
| 2 | + "source": "https://doi.org/10.37236/1623", | |
| 3 | + "source_page": 7, | |
| 4 | + "access_date": "2026-11-12", | |
| 5 | + "python": "3.9.6", | |
| 6 | + "n12_sha256": "fec1694bab8c1864318ae2f83928aca6b871b94a7b03721202a59e32945f2a43", | |
| 7 | + "precision_checks": [ | |
| 8 | + { | |
| 9 | + "decimal_places": 6, | |
| 10 | + "generator_seconds": 4.879100000000289e-05, | |
| 11 | + "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325987100, on lines 1, 5 and 7\nn = 12: 0.0325987100" | |
| 12 | + }, | |
| 13 | + { | |
| 14 | + "decimal_places": 10, | |
| 15 | + "generator_seconds": 4.7165999999994324e-05, | |
| 16 | + "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 5 and 7\nn = 12: 0.0325988586" | |
| 17 | + }, | |
| 18 | + { | |
| 19 | + "decimal_places": 30, | |
| 20 | + "generator_seconds": 6.0457999999999346e-05, | |
| 21 | + "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 3 and 5\nn = 12: 0.0325988586" | |
| 22 | + }, | |
| 23 | + { | |
| 24 | + "decimal_places": 60, | |
| 25 | + "generator_seconds": 7.02910000000001e-05, | |
| 26 | + "verify_output": "n12.txt: 12 points in the unit square, smallest triangle 0.0325988586, on lines 1, 5 and 7\nn = 12: 0.0325988586" | |
| 27 | + } | |
| 28 | + ] | |
| 29 | +} | |