Feasibility conditions for non-symmetric 3-class association schemes (Q1126187): Difference between revisions

The motivation for this paper comes from the problem of finding conditions for a symmetric association scheme (see the book of \textit{E. Bannai} and \textit{I. Ito} [Algebraic combinatorics. I: Association schemes (1984; Zbl 0555.05019)]) that imply that this scheme can be the symmetric closure of a non-symmetric association scheme. In particular, the authors study 2-schemes and provide feasibility conditions for 2-schemes to be the symmetric closure of a non-symmetric 3-scheme. There exist infinitely many non-symmetric 3-schemes (see the work of \textit{R. A. Liebler} and \textit{R. A. Mena} [J. Comb. Theory, Ser. A 47, No. 1, 111-123 (1988; Zbl 0641.05022)]). The actual results of the paper are too technical to be stated in this review.