Conway 99-graph research: an exact modular completion criterion for strongly regular graph lifts with free order-three symmetry. Unreviewed, AI-assisted; proof and reproducible checks.
-
Updated
Sep 5, 2026 - Python
Conway 99-graph research: an exact modular completion criterion for strongly regular graph lifts with free order-three symmetry. Unreviewed, AI-assisted; proof and reproducible checks.
To associate your repository with the conway-99 topic, visit your repo's landing page and select "manage topics."