Id: palomar/PALOMAR-2026-11-13-000004 Url: https://github.com/Nosdormas/melete-math/tree/55b78b56c3e56874ccf46b90855640b11b961a4b/dsrg-rank-method/lean Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-13-000004-v1.json Repo: https://github.com/Nosdormas/melete-math Tags: math.CO, msc:05C20, msc:05E30 Score: 0 Title: Nonexistence of directed strongly regular graphs by rank arguments Trust: high Domain: math.CO Source: palomar Authors: Iurii Ivanov Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-13 Formalized: true Formalizes: title=Nonexistence of DSRGs with ten parameter sets: the rank of A − θI versus a submatrix prescribed at a vertex identifier= relationship=formalizes Page: https://delphi.science/r/palomar/PALOMAR-2026-11-13-000004 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…