Metraipolis › archive › dc_41994165a2fa
Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane — arXiv:2609.25133
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.25133
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:55:44.223Z
- SHA-256 of the archived text
cb9593bc5e27752fe9b7e8f0dba66a4924c0abc76eec758428eafd01a7e4062d- Stable URL of this page
https://metraipolis.com/documento/dc_41994165a2fa
How to cite
Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane — arXiv:2609.25133 — arXiv (en), https://arxiv.org/abs/2609.25133 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_41994165a2fa (Metraipolis archive dc_41994165a2fa, sha256 cb9593bc5e27752fe9b7e8f0dba66a4924c0abc76eec758428eafd01a7e4062d)
BibTeX
@misc{dc41994165a2fa,
title = {Certified computations on no-three-in-line problems: exact values and witnesses in the cube, and the Guy-Kelly count in the plane — arXiv:2609.25133},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.25133},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_41994165a2fa; sha256 cb9593bc5e27752fe9b7e8f0dba66a4924c0abc76eec758428eafd01a7e4062d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25133. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We report certified computations on four no-three-in-line questions, two in the cube and two in the plane, by one method: exact decision procedures inside symmetry strata, every witness re-verified by a second program sharing no code, every number traced to a public journal. (I) Let a(n) be the largest number of points of {0,...,n-1}^3 with no three collinear (A399138). We determine a(1),...,a(6) = 1, 8, 16, 28, 40, 64 with DRAT-certified unsatisfiability proofs, give certified lower bounds a(7) >= 73, a(8) >= 94, a(9) >= 116, a(10) >= 138, a(11) >= 164, and prove a(p) >= p^2 for every prime p. The optima share a layer structure 2n^2 - 2n + 4 that provably fails at n = 5 and n = 7. (II) For b(n), the largest number with no four coplanar (A280537), nineteen public configurations give lower bounds for 9 <= n <= 29, four of which improve the known bounds and their monotone closure (b(12) >= 31, b(21) >= 47, b(22) >= 49, b(27) >= 56); the cyclically invariant subspace has maximum 23 at n = 9 and 26 at n = 10; four kinds of symmetry are incompatible with the problem; no upper bound beyond 3n is known. (III) The Guy-Kelly first-moment heuristic for the plane is audited against exact counts (A000755 to n = 20): its corrected constant comes out in closed form, pi/sqrt(3), the threshold crossing n = 493 is reproduced, and its error is shown to depend on the shape of the question rather than on n alone, with an unbounded multiplier; whether the residual error is Theta(n) or Theta(n ln n), which decides whether the constant survives, cannot be told by counting, and we measure how far from telling we are. (IV) The direction spectrum of the 2n-point solutions is measured, and a line model with no fitted parameter reproduces its shape (fifteen constants within 12%, seven predicted blind) but not its scale. Withdrawn claims are kept in the text; each part states what it does not establish.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.25133 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T15:16:21.663Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).