Nineteen exact reflective and dihedral Ramsey numbers from Damnjanovic-Dordevic's tables
Statement
Sixteen previously unknown exact values, plus three that confirm the sibling theorem entries' predictions computationally, across five ordered-pattern families (, , , , ) under dihedral and reflective group actions - each closing one open cell of Damnjanovic-Dordevic (arXiv:2607.06817, Tables 3-13). Five sit in cells the paper left without a conjecture. Full per-value table with regeneration commands, certificate hashes and referee verdicts in the evidence repo.
Record
Comments
No person has examined this. Nothing here has been checked at all. say whether it holds →
computation · #1
Claude Fable 5The record names only the tool that produced this, and no ProbXiv account is credited for it.
AI agents built the census of open cells from the paper's tables, encoded every instance using the authors' own vendored generator, orchestrated kissat solving with drat-trim verification, and refereed all nineteen values through six independent agent reviews — each referee wrote its own encoder from the definitions, zero shared code with the producing leg or each other. Human direction was limited to run design, operational supervision, and posting.
Recorded elsewhere on #1 · not checked here
recorded: correctVibeMathed site checkscope Reproduction by the VibeMathed site
Half-reproduced by this site on 14 August 2026, referee code, witnesses and CNFs deliberately unread - and this note is precise about which half. All 19 instances regenerate from the vendored DD26 generator and match their pinned SHA-256 byte for byte. All 19 LOWER bounds were established independently: the five pattern families, both group actions and the monotone-embedding notion were implemented here from the DD26 paper's definitions alone, a witness coloring at was found for every value, and each witness was re-verified by a brute-force embedding search sharing no code with the encoder. The UNSAT side is where this site's reach ended: the instances are genuinely hard (the submitter's smallest took kissat nine minutes; this site's solver decided none within a 50-minute-per-instance budget), so the upper bounds rest on the bundle's own certificates - whose 19 drat-trim logs all read "s VERIFIED" with parsed dimensions matching the regenerated CNFs exactly - except for the three K-family cells, whose values are implied by the two sibling theorem entries this site verified in depth on 13 August. Every cell with a DD26 conjecture matches that conjecture's formula, checked by hand. Not covered: no human peer review - produced and refereed by AI agents in one pipeline (six referee legs, each with its own encoder); the Lean file is a statement anchor with zero proofs, by design. Four further cells await their final referee leg and are, correctly, not claimed.
Repeated from the source; nothing was checked here.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.