Nonexistence of directed strongly regular graphs by rank arguments
Source: github.com/Nosdormas/melete-math/tree/55b78b56c3e56874ccf46…
Lean 4 and Mathlib proofs that no directed strongly regular graph exists for 28 parameter sets (v, k, t, λ, μ). A directed strongly regular graph is a 0-1 matrix A with zero diagonal, all row and column sums equal to k and A² = tI + λA + μ(J − I − A). Nine of the parameter sets are those of the paper below: (50, 11, 7, 0, 3), (68, 13, 7, 0, 3), (100, 16, 7, 0, 3), (108, 19, 9, 0, 4), (55, 16, 12, 1, 6), (66, 10, 5, 4, 1), (91, 12, 6, 5, 1), (96, 15, 10, 9, 1) and (28, 6, 3, 2, 1); the tenth set of the paper, (48, 9, 5, 0, 2), is not formalized. The same lemmas exclude eight further sets, and…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-13-000004
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-13-000004/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-11-13-000004/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'