Abstract
LetG be a group of finite order andD 0 = {e},D 1,...,D d be a partition ofG. Suppose{d −1|d ∈D i } =D i′, i′ ∈ {0, 1,..., d}, for eachi ∈ {0, 1,..., d}; and\(\bar D_i ,\bar D_j = \sum\limits_{k = 0}^d {p_{ij}^k } \bar D_k \) for alli, j where\(\bar D_m , = \sum\limits_{g \in D_m } g \in \mathbb{C}[G]\). Then the subalgebra spanned by\(\bar D_0 ,\bar D_1 , \ldots ,\bar D_d \) is called a Schur ring overG. It is known that such a partitionD 0,D 1,...,D d can be used to construct an association scheme of classd. In this paper, we obtain a complete classification for the case whenG is cyclic andd = 3. The result corresponds to a complete classification of cyclic association schemes of class three.
Similar content being viewed by others
References
Bannai, E., Ito, T.: Algebraic Combinatorics I: Association Schemes. Menlo Park: Benjamin/Cumming 1984.
Bose, R.C., Nair, K.P.: Partially balanced incomplete block designs. Sankhyā,4, 337–372 (1939)
Bridges, W.G., Mena, R.A.: Rational circulants with rational spectra and cyclic strongly regular graphs. Ars Comb.,8, 143–161 (1979)
Delsarte, P.: An algebraic approach to the association schemes of coding Theory. Philips J. Res. Repts., Suppl. No. 10, 1973
Ma, S.L.: Polynomial Addition Sets. Ph.D. Thesis, University of Hong Kong, 1985
Raghavarao, D.: Constructions and Combinatorial Problems in Designs of Experiments. New York: Wiley 1971
Schur, I.: Zur Theorie der einfach transitiven Permutationsgruppen. Sitzumgsber. Preuss. Akad. Wiss. Berlin, Phys-math. Kl., 598–623 (1933)
Wielandt, H.: Zur Theorie der einfach transitiven Permutationsgruppen II, Math. Z.,52, 384–393 (1949)
Wielandt, H.: Finite Permutation Groups. New York: Academic Press 1964
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ma, S.L. Schur rings and cyclic association schemes of class three. Graphs and Combinatorics 5, 355–361 (1989). https://doi.org/10.1007/BF01788691
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01788691