2000 character limit reached
Divisible design graphs from symplectic graphs over rings with precisely three ideals
Published 6 Dec 2024 in math.CO | (2412.04962v1)
Abstract: In this paper we construct two new infinite families of divisible design graphs based on symplectic graphs over rings with precisely three ideals.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.