Explicit construction of infinite families of strongly regular digraphs with parameters ((v+(2n+1-4)t)2n-1, k+(2n-2)t, t, λ, t)
Abstract
An explicit construction of infinite sequences of strongly regular digraphs with parameter sets ((v+(2n+1-4)t)2n-1, k+(2n-2)t, t, λ, t) is described. A computer program was used to find the initial digraphs. The remaining terms of the sequence are obtained by the constructed recurrence. Using the described approach, 11 families of strongly regular digraphs were found. In particular, these families contain digraphs dsrg(72, 18, 5, 3, 5), dsrg(76, 19, 5, 4, 5), dsrg(92, 23, 6, 5, 6) and dsrg(104, 26, 7, 5, 7), the question of the existence of which was previously open.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.