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.
Context
Nineteen individual exact values, each decided by SAT certificate: unsatisfiable at the claimed , witnessed satisfiable at . They close cells in DD26's Tables 3-13 but settle no infinite family - the sibling entries do that for the column. The three overlap cells are , and , each an instance of a sibling theorem; the remaining sixteen stand on their own certificates. Four further cells passed the producing solver but await their final referee leg and are not claimed. Open: every other cell of DD26's tables, all cyclic-action and online-Ramsey cells.
Nineteen finite table cells from a five-week-old paper in a niche new area, none settling a conjecture in full generality - the two theorem entries this accompanies did that for one family. Real, checkable, and five cells carry values the paper did not even conjecture; but each is one cell. Level with the a = 3 slice (5): above the single-gadget variant (4), below the a >= 4 theorem (8).
People
Attempts
No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
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.
Reviews
1 machine checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope 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.
No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.