Divisible design graphs from symplectic graphs over rings with precisely three ideals
Abstract
In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
0
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.