arXiv Analytics

Sign in

arXiv:0808.3676 [math.CO]AbstractReferencesReviewsResources

Pseudocyclic association schemes and strongly regular graphs

Akihiro Munemasa, Takuya Ikuta

Published 2008-08-27, updated 2009-07-31Version 3

Let X be a pseudocyclic association scheme in which all the nontrivial relations are strongly regular graphs with the same eigenvalues. We prove that the principal part of the first eigenmatrix of X is a linear combination of an incidence matrix of a symmetric design and the all-ones matrix. Amorphous pseudocyclic association schemes are examples of such association schemes whose associated symmetric design is trivial. We present several non-amorphous examples, which are either cyclotomic association schemes, or their fusion schemes. Special properties of symmetric designs guarantee the existence of further fusions, and the two known non-amorphous association schemes of class 4 discovered by van Dam and by the authors, are recovered in this way. We also give another pseudocyclic non-amorphous association scheme of class 7 on GF(2^{21}), and a new pseudocyclic amorphous association scheme of class 5 on GF(2^{12}).

Related articles: Most relevant | Search more
arXiv:2409.10620 [math.CO] (Published 2024-09-16)
The Lower Bound for Number of Hexagons in Strongly Regular Graphs with Parameters $λ=1$ and $μ=2$
arXiv:1312.4973 [math.CO] (Published 2013-12-17)
The metric dimension of small distance-regular and strongly regular graphs
arXiv:1401.6816 [math.CO] (Published 2014-01-27)
Strongly regular graphs with the 7-vertex condition