2000 character limit reached
Pseudocyclic and non-amorphic fusion schemes of the cyclotomic association schemes
Published 10 Dec 2010 in math.CO | (1012.2181v2)
Abstract: We construct twelve infinite families of pseudocyclic and non-amorphic association schemes, in which each nontrivial relation is a strongly regular graph. Three of the twelve families generalize the counterexamples to A. V. Ivanov's conjecture by Ikuta and Munemasa [15].
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.