The Bannai–Munemasa–Venkov lattice method for strongly regular graphs: a uniform discriminant-form condition and new nonexistence results
Bannai, Munemasa and Venkov, and later Nebe and Venkov, excluded tight spherical designs — among them strongly regular graphs of a special kind — by studying the lattice spanned by the design: they bound its discriminant group, pass to an even (over)lattice, and compare Gauss sums by the Milgram–Braun formula. We extend this method to arbitrary strongly regular graphs with integral eigenvalues. For an integral representation G=b(A-ρ I)+cJ that is positive semidefinite with even diagonal, an elementary identity for dual vectors ties every class of the discriminant form of a maximal even…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00225
curl -X POST /api/v1/records/hexagon/2610.00225/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00225/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'