On non-symmetric commutative association schemes with exactly one pair of non-symmetric relations

For a given non-symmetric commutative association scheme, by fusing all the non-symmetric relations pairwise with their symmetric counterparts, we can obtain a new symmetric association scheme. In this paper, we introduce a set of feasibility and realizability conditions for a class e symmetric association scheme to be split into a class e+1 non-symmetric commutative association scheme. By applying the feasibility and realizability conditions, we obtain a classification into six categories of the class 4 non-symmetric fission schemes of group-divisible 3-schemes. Complete solutions for three of the six categories and partial results for the remaining cases are presented.     

Four-class skew-symmetric association schemes

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we investigate 4-class skew-symmetric association schemes. In recent work by the first author it was discovered that their character tables fall into three types. We now determine their intersection matrices. We then determine the character tables for 4-class skew-symmetric pseudocyclic association schemes, the only known examples of which are cyclotomic schemes. As a result, we answer a question raised by S.Y. Song in 1996. We characterize and classify 4-class imprimitive skew-symmetric association schemes. We also prove that none of 2-class Johnson schemes admits a 4-class skew-symmetric fission scheme. Based on three types of character tables above, a short list of feasible parameters is generated.     

On the Normal Structure of NonCommutative Association Schemes of Rank 6

The concept of an association scheme is a far-reaching generalization of the notion of a group. Many group theoretic facts have found a natural generalization in scheme theory. One of these generalizations is the observation that, similar to groups, association schemes of finite order are commutative if they have at most five elements and not necessarily commutative if they have six elements. While there is (up to isomorphism) only one noncommutative group of order 6, there are infinitely many pairwise non-isomorphic noncommutative association schemes of finite order with six elements. (Each finite projective plane provides such a scheme, and non-isomorphic projective planes yield non-isomorphic schemes.) In this note, we investigate noncommutative schemes of finite order with six elements which have a symmetric normal closed subset with three elements. We take advantage of the classification of the finite simple groups.     

Relation graphs of an association scheme based on attenuated spaces

The set of subspaces with a given dimension in an attenuated space has a structure of a symmetric association scheme, which is a generalization of both Grassmann schemes and bilinear forms schemes. In this paper, we focus on two families of relation graphs. Their full automorphism groups are completely determined. As a consequence, the classical results of the automorphism groups of Grassmann graphs and bilinear forms graphs are generalized.     

伪辛空间F^(2v+2+l)_q中一类2维子空间的结合方案及其结构

该文利用伪辛空间F\-q\+\{(2v+2+l)中一类2 维非迷向子空间构作了具有2q-1个结合类的交换的但非对称的结合方案，并且讨论了它的结构，证明了它是其基础域上的加法群和乘法群上的熟知的结合方案的扩张。     

Three-Class Association Schemes

We study (symmetric) three-class association schemes. The graphs with four distinct eigenvalues which are one of the relations of such a scheme are characterized. We also give an overview of most known constructions, and obtain necessary conditions for existence. A list of feasible parameter sets on at most 100 vertices is generated.     

Strongly Regular Decompositions of the Complete Graph

We study several questions about amorphic association schemes and other strongly regular decompositions of the complete graph. We investigate how two commuting edge-disjoint strongly regular graphs interact. We show that any decomposition of the complete graph into three strongly regular graphs must be an amorphic association scheme. Likewise we show that any decomposition of the complete graph into strongly regular graphs of (negative) Latin square type is an amorphic association scheme. We study strongly regular decompositions of the complete graph consisting of four graphs, and find a primitive counterexample to A.V. Ivanov's conjecture which states that any association scheme consisting of strongly regular graphs only must be amorphic.     

Imprimitive cometric association schemes: Constructions and analysis

Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others being left as open problems. In particular, we prove that any Q-antipodal association scheme is dismantlable: the configuration induced on any subset of the equivalence classes in the Q-antipodal imprimitivity system is again a cometric association scheme. Further examples are explored. Dedicated to the memory of Dom de Caen, 1956—2002.     

Association Schemes Related to Kasami Codes and Kerdock Sets

Two new infinite series of imprimitive 5-class association schemes are constructed. The first series of schemes arises from forming, in a special manner, two edge-disjoint copies of the coset graph of a binary Kasami code (double error-correcting BCH code). The second series of schemes is formally dual to the first. The construction applies vector space duality to obtain a fission scheme of a subscheme of the Cameron-Seidel 3-class scheme of linked symmetric designs derived from Kerdock sets and quadratic forms over GF(2).     

Association Schemes with at Most Two Nonlinear Irreducible Characters and Applications to Finite Groups

An irreducible character χ of an association scheme is called nonlinear if the multiplicity of χ is greater than 1. The main result of this paper gives a characterization of commutative association schemes with at most two nonlinear irreducible characters. This yields a characterization of finite groups with at most two nonlinear irreducible characters. A class of noncommutative association schemes with at most two nonlinear irreducible character is also given.     

A class of highly symmetric graphs,symmetric cylindrical constructions and their spectra

In this article, we introduce the algebra of block-symmetric cylinders and we show that symmetric cylindrical constructions on base-graphs admitting commutative decompositions behave as generalized tensor products. We compute the characteristic polynomial of such symmetric cylindrical constructions in terms of the spectra of the base-graph and the cylinders in a general setting. This gives rise to a simultaneous generalization of some well-known results on the spectra of a variety of graph amalgams, as various graph products, graph subdivisions and generalized Petersen graph constructions. While our main result introduces a connection between spectral graph theory and commutative decompositions of graphs, we focus on commutative cyclic decompositions of complete graphs and tree-cylinders along with a subtle group labeling of trees to introduce a class of highly symmetric graphs containing the Petersen and the Coxeter graphs. Also, using techniques based on recursive polynomials we compute the characteristic polynomials of these highly symmetric graphs as an application of our main result.     

Some implications on amorphic association schemes

We give an overview of results on amorphic association schemes. We give the known constructions of such association schemes, and enumerate most such association schemes on up to 49 vertices. Special attention is paid to cyclotomic association schemes. We give several results on when a strongly regular decomposition of the complete graph is an amorphic association scheme. This includes a new proof of the result that a decomposition of the complete graph into three strongly regular graphs is an amorphic association scheme, and the new result that a strongly regular decomposition of the complete graph for which the union of any two relations is again strongly regular must be an amorphic association scheme.     

Type II Matrices and Their Bose-Mesner Algebras

Type II matrices were introduced in connection with spin models for link invariants. It is known that a pair of Bose-Mesner algebras (called a dual pair) of commutative association schemes are naturally associated with each type II matrix. In this paper, we show that type II matrices whose Bose-Mesner algebras are imprimitive are expressed as so-called generalized tensor products of some type II matrices of smaller sizes. As an application, we give a classification of type II matrices of size at most 10 except 9 by using the classification of commutative association schemes.     

On a Class of Non-commutative Imprimitive Association Schemes of Rank 6

Many facts about group theory can be generalized to the context of the theory of association schemes. In particular, association schemes with fewer than 6 elements are all commutative. While there is a nonabelian group with 6 elements which is unique up to isomorphism, there are infinitely many isomorphism classes of non-commutative association schemes with 6 elements. All examples previously known to us are imprimitive, and fall into three classes which are reasonably well understood. In this paper, we construct a fourth class of noncommutative, imprimitive association schemes of rank 6.     

伪辛空间F_q~(2v+2+l)中一类2-维子空间的结合方案及其结构

该文利用伪辛空间Fq(2v+2+l)中一类2-维非迷向子空间构作了具有2q-1个结合类的交换 的但非对称的结合方案,并且讨论了它的结构,证明了它是其基础域上的加法群和乘法群上的 熟知的结合方案的扩张.     

On the Brauer-Wielandt-Harada theorem for group-like regular association schemes

We consider a generalization of the Brauer-Wielandt-Harada Theorem to group-like regular association schemes. As an application, we give a necessary condition for commutative association schemes to be regular. Moreover, we derive the number of irreducible characters of multiplicity 1 from the product of all adjacency matrices and all valencies for a commutative regular association scheme.     

Valency seven symmetric graphs of order 2<Emphasis Type="Italic">pq</Emphasis>

A graph is said to be symmetric if its automorphism group acts transitively on its arcs. In this paper, all connected valency seven symmetric graphs of order 2pq are classified, where p, q are distinct primes. It follows from the classification that there is a unique connected valency seven symmetric graph of order 4p, and that for odd primes p and q, there is an infinite family of connected valency seven one-regular graphs of order 2pq with solvable automorphism groups, and there are four sporadic ones with nonsolvable automorphism groups, which is 1, 2, 3-arc transitive, respectively. In particular, one of the four sporadic ones is primitive, and the other two of the four sporadic ones are bi-primitive.     

Quantum symmetric Kac–Moody pairs

The present paper develops a general theory of quantum group analogs of symmetric pairs for involutive automorphism of the second kind of symmetrizable Kac–Moody algebras. The resulting quantum symmetric pairs are right coideal subalgebras of quantized enveloping algebras. They give rise to triangular decompositions, including a quantum analog of the Iwasawa decomposition, and they can be written explicitly in terms of generators and relations. Moreover, their centers and their specializations are determined. The constructions follow G. Letzter's theory of quantum symmetric pairs for semisimple Lie algebras. The main additional ingredient is the classification of involutive automorphisms of the second kind of symmetrizable Kac–Moody algebras due to Kac and Wang. The resulting theory comprises various classes of examples which have previously appeared in the literature, such as q-Onsager algebras and the twisted q-Yangians introduced by Molev, Ragoucy, and Sorba.     

A Family of Partial Geometric Designs from Three‐Class Association Schemes

In this paper, we show that partial geometric designs can be constructed from certain three‐class association schemes and ternary linear codes with dual distance three. In particular, we obtain a family of partial geometric designs from the three‐class association schemes introduced by Kageyama, Saha, and Das in their article [“Reduction of the number of associate classes of hypercubic association schemes,” Ann Inst Statist Math 30 (1978)]. We also give a list of directed strongly regular graphs arising from the partial geometric designs obtained in this paper.     

Balancedly splittable Hadamard matrices

Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are presented. As an application, commutative association schemes of 4, 5, and 6 classes are constructed.