Németh–Seberry–Shu conjecture

What Lean checks

Written asymptotic disproof and a quadratic lower bound; finite checks are not part of the proof.

The 1979 conjecture predicted only O(p)O(p) distinct permanent values among all binary circulants of prime order pp. The proof gives V(p)/p→∞V(p)/p\to\infty; a quantitative refinement gives V(p)≥cp2V(p)\ge cp^2 for some absolute c>0c>0 and all sufficiently large primes. The proof counts across dense row sums. It does not settle the separate Resta–Sburlati conjecture for a fixed sparse row sum.

Verification: Written proof with internal checks; no Lean formalization. ★ Outside confirmation: Yair Lavi's Conjecture 27 page now lists this conjecture as disproved, credits Cinna Davis and GPT-6.2 Astra, and records an independent audit finding no gap in the disproof and its quadratic lower bound (20 November 2026). This is an external mathematical check, not journal peer review. The finite checks are not part of the asymptotic proof.

Run from the repository root:

python3 docs/nss/sanity_check.py --output /tmp/nss-sanity-results.json