A 256-step certificate for Turán's pure power-sum constant
Version 1 / Oct 23, 2026 / CC BY 4.0
Abstract
Provenance statement
Tools used
- OpenAI
- CodexVersion GPT-6.1 Sol
- FLINT
- Arb ball arithmetic (python-flint)
References
- T. Tao and contributors, Optimization constants in mathematics, 42a , https://teorth.github.io/optimizationproblems/constants/42a.html.link
- A. Biró, An upper estimate in Turán's pure power sum problem , Indag. Math. (N.S.) 11 (2000), 499--508.
- S. Griego, An improved asymptotic certificate for Turán's pure power sum constant , v1.0.0, https://github.com/sebastian-griego/turan-c42-certificate/tree/v1.0.0.link
- A. Röhrig, Verification certificates for C42 and C51 , 9 September 2026, commit ed6387399cf6de02eaa4cf10c43787633496619a, https://github.com/AndreRoehrig/optimization-constants-certificates.link
- K. Plata, Proposed six-level bound for Turan's pure power-sum constant , public review draft, https://github.com/krplatz/turan-c42-six-level-review.link
Version history
- v1Submitted by Ricardo PinhoInitial depositCurrentOct 22, 2026