Pith. sign in

REVIEW 1 cited by

On strongly regular graph with parameters (65; 32; 15; 16)

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.05432 v1 pith:EZ7NVEMU submitted 2021-02-10 math.CO

Oleg Gritsenko This is my paper · ORCID
classification math.CO
keywords congruencesgraphmatricesparametersregularstronglyadjacencyapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We construct a strongly regular graph with the parameters (65; 32; 15; 16). The idea is to search for an adjacency matrix that consists of circulant blocks. Equations with such matrices can be reduced to congruences with polynomials matrices of smaller orders. We can consider these congruences over different moduli for a more efficient computational approach.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Finite permutation groups with quasi-semiregular elements

    math.GR 2025-07 conditional novelty 6.0 of 10

    Finite primitive permutation groups admitting a quasi-semiregular element have O'Nan-Scott type HA, AS, PA, SD or CD, and the alternating and sporadic almost simple cases are classified explicitly.

Pith tools