Pseudocyclic association schemes and strongly regular graphs

Details Pseudocyclic association schemes and strongly regular graphs Pseudocyclic association schemes and strongly regular graphs

2008-08-27

arxiv.org/abs/0808.3676v3

Mathematics

Combinatorics

corrected a typo

Scientific paper

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}).

Affiliated with

Also associated with

No associations

Rating

Pseudocyclic association schemes and strongly regular graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pseudocyclic association schemes and strongly regular graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pseudocyclic association schemes and strongly regular graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-528979