An explicit periodic signing of C_n(1,2) below the conjectured minimum
The paper's disproof of Suvagiya's signed-circulant minimum conjecture on an infinite arithmetic progression, formalized at the matrix level. For every n divisible by 8, Lean defines the paper's period-8 triangle-flux signing of the circulant graph C_n(1,2) as an explicit signed adjacency matrix, proves it is a plus-minus-one signing of mathlib's circulant graph, and proves by exact rational sum-of-squares window certificates that every eigenvalue has absolute value at most 1397/500. For every n >= 32 this rational separator lies strictly below the conjectured minimum rho_-(n) =…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-09-02-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-02-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-09-02-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'