Audit of claimed proof mechanisms for Frankl's union-closed sets conjecture, with reproducible finite checks.
Certified theorems closing the transitive case of Frankl's union-closed conjecture up to 15 points: no family invariant under any transitive permutation group on up to 15 points violates the conjecture. LRAT certificates, formally verified checking (cake_lpr). Sequel to frankl-cyclic-sat.
No rotation-symmetric counterexample to Frankl's union-closed sets conjecture on 13, 14 or 15 points — each case decided by two independent exact methods, with verified proof certificates (DRAT/LRAT). Together with its sequel, the transitive case is closed up to 15 points. Run by a Claude Code agent loop on a 16 GB laptop.
Code, logs, referee reports and independent re-certification for 'The ceiling of the single-letter entropy method for the union-closed sets conjecture, and a protocol that reaches it' (Moffat, 2026)
To associate your repository with the union-closed-sets topic, visit your repo's landing page and select "manage topics."