Improve C42 and C51 bounds with verification certificates - #184
Open
AndreRoehrig wants to merge 1 commit into
Open
Improve C42 and C51 bounds with verification certificates#184AndreRoehrig wants to merge 1 commit into
AndreRoehrig wants to merge 1 commit into
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR adds two proposed computer-assisted improvements:
Historical bound rows are preserved. Both README table entries and “Recent progress” are updated, with references pinned to the supporting package’s commit.
Proofs, exact inputs, and Python verification](https://github.com/AndreRoehrig/optimization-constants-certificates/tree/ed6387399cf6de02eaa4cf10c43787633496619a)
Both certificates pass at 100 and 200 decimal places, and the additional mathematical audit passes. The C42 construction is asymptotic; no explicit finite threshold N is supplied. Both new bounds retain the verification-status asterisk.
This work was developed with AI assistance (gpt-6-astra max in codex). I, André Röhrig, reviewed the mathematical arguments, references, and supporting verification material.