erdos-ant-verification: An Executable Reproduction Artifact for Equation (2.2) of the Erdős Unit-Distance Disproof Remarks Paper
Fuente:
Zenodo
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Recurso digital |
| Publicado: |
Zenodo
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866902166139043840 |
|---|---|
| author | Yun, Kwansub Flamehaven Initiative |
| author_facet | Yun, Kwansub Flamehaven Initiative |
| contents | An open-source Python implementation that re-derives equation (2.2) of the 2026 Erdős unit-distance disproof remarks paper (Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang, Matchett Wood) for the explicit construction T = {3,5,7,11,13,17}, S = {101, infinity}, L_T = Q(sqrt 5, sqrt 13, sqrt 17, sqrt 21, sqrt 33), and returns delta_excess = 6.2391e-38, matching the published two-significant-figure value 6.24e-38 to 1.4e-4 relative error. Uses mpmath at 200-bit precision because the result collapses to zero in float64. The artifact does NOT contain a new mathematical proof, does NOT construct the infinite Golod-Shafarevich tower whose existence is invoked in the proof, does NOT reproduce any sharpened bound such as Sawin's separately published delta ~ 0.014, and has NOT been peer-reviewed. It is a citable, CI-tested reproducibility artifact for the single numerical lower bound stated verbatim in the remarks paper. |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_20381657 |
| institution | Zenodo |
| language | |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | erdos-ant-verification: An Executable Reproduction Artifact for Equation (2.2) of the Erdős Unit-Distance Disproof Remarks Paper Yun, Kwansub Flamehaven Initiative erdos-unit-distance algebraic-number-theory golod-shafarevich class-field-tower discrete-geometry combinatorics reproducibility executable-verification mathematical-verification mpmath openai-research sawin-construction An open-source Python implementation that re-derives equation (2.2) of the 2026 Erdős unit-distance disproof remarks paper (Alon, Bloom, Gowers, Litt, Sawin, Shankar, Tsimerman, Wang, Matchett Wood) for the explicit construction T = {3,5,7,11,13,17}, S = {101, infinity}, L_T = Q(sqrt 5, sqrt 13, sqrt 17, sqrt 21, sqrt 33), and returns delta_excess = 6.2391e-38, matching the published two-significant-figure value 6.24e-38 to 1.4e-4 relative error. Uses mpmath at 200-bit precision because the result collapses to zero in float64. The artifact does NOT contain a new mathematical proof, does NOT construct the infinite Golod-Shafarevich tower whose existence is invoked in the proof, does NOT reproduce any sharpened bound such as Sawin's separately published delta ~ 0.014, and has NOT been peer-reviewed. It is a citable, CI-tested reproducibility artifact for the single numerical lower bound stated verbatim in the remarks paper. |
| title | erdos-ant-verification: An Executable Reproduction Artifact for Equation (2.2) of the Erdős Unit-Distance Disproof Remarks Paper |
| topic | erdos-unit-distance algebraic-number-theory golod-shafarevich class-field-tower discrete-geometry combinatorics reproducibility executable-verification mathematical-verification mpmath openai-research sawin-construction |
| url | https://doi.org/10.5281/zenodo.20381657 |