Збережено в:
| Автори: | , |
|---|---|
| Формат: | Recurso digital |
| Мова: | |
| Опубліковано: |
Zenodo
2026
|
| Предмети: | |
| Онлайн доступ: | https://doi.org/10.5281/zenodo.20377950 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Зміст:
- An open-source Python implementation that computationally verifies the finite, checkable parts of the 2026 OpenAI/Sawin disproof of the Erdős planar unit-distance conjecture. Reproduces equation (2.2) of the remarks PDF (delta >= ~6.24e-38 for the explicit construction with T = {3,5,7,11,13,17}, S = {101, infinity}, L_T = Q(sqrt 5, sqrt 13, sqrt 17, sqrt 21, sqrt 33)) to within 0.014% relative error using mpmath at 200-bit precision. The artifact does NOT contain a new mathematical proof, does NOT construct the infinite Golod-Shafarevich tower, and has NOT been peer-reviewed. It is intended as a citable reproducibility artifact for the published numerical lower bound.