Commutative Association Schemes Whose Symmetrizations Have Two Classes

If a symmetric association scheme of class two is realized as the symmetrization of a commutative association scheme, then it either admits a unique symmetrizable fission scheme of class three or four, or admits three fission schemes, two of which are class three and one is of class four. We investigate the classification problem for symmetrizable (commutative) association schemes of two-class symmetric association schemes. In particular, we give a classification of association schemes whose symmetrizations are obtained from completely multipartite strongly regular graphs in the notion of wreath product of two schemes. Also the cyclotomic schemes associated to Paley graphs and their symmetrizable fission schemes are discussed in terms of their character tables.     

On higher indicators of regular association schemes

In the present paper, we will define the higher Frobenius–Schur indicators and the higher indicators of association schemes as a generalization of those of finite groups. The higher indicators of any association scheme are always positive rational numbers. Especially, for any positive integer $n$, the $n$th indicator of any regular association scheme is the number of relations such that its strong girth divides $n$. Thus, all higher indicators of any regular association scheme are natural numbers, and the sequence of the indicators is periodic. We will show that the converses of these facts are also true for finite exponent association schemes. Finally, we introduce a family of infinite exponent association schemes all higher indicators of which are natural numbers and the sequence of the indicators of which is periodic.     

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

On Even Generalized Table Algebras

Generalized table algebras were introduced in Arad, Fisman and Muzychuk (Israel J. Math. 114 (1999), 29–60) as an axiomatic closure of some algebraic properties of the Bose-Mesner algebras of association schemes. In this note we show that if all non-trivial degrees of a generalized integral table algebra are even, then the number of real basic elements of the algebra is bounded from below (Theorem 2.2). As a consequence we obtain some interesting facts about association schemes the non-trivial valencies of which are even. For example, we proved that if all non-identical relations of an association scheme have the same valency which is even, then the scheme is symmetric.     

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.     

A Characterization of Association Schemes from Affine Spaces

We characterize theassociation schemes from affine spaces as the association schemesin which all relations are equivalence relations (when unitedwith the identity relation). The schemes from affine spaces ofdimension at least three are counterexamples of a conjectureof A. V. Ivanov [Problem 1.3]I on amorphic schemes.     

Schur rings and non-symmetric association schemes on 64 vertices

In this paper we enumerate essentially all non-symmetric association schemes with three classes, less than 96 vertices and with a regular group of automorphisms. The enumeration is based on a computer search in Schur rings. The most interesting cases have 64 vertices.In one primitive case and in one imprimitive case where no association scheme was previously known we find several new association schemes. In one other imprimitive case with 64 vertices we find association schemes with an automorphism group of rank 4, which was previously assumed not to be possible.     

二面体群上构作的结合方案

本文研究了二面体群的元素的等价划分问题。利用群在集合上的作用,在二面体群上构造了一类新的结合方案,并且计算了这类结合方案的所有参数。进一步,得到了一类强正则图。所得到的结果丰富了结合方案理论。     

利用有限域上非零向量的道路图结构与内积构作结合方案

Um（n,R）表示域F上n元非零向量之集．本文先确定了有限域上n≥5维非零向量的道路图结构,然后利用有限域Fq上Um（n,R）／EnR中具有相同范数的向量的道路图结构与内积构作了具有多个结合的结合方案,并计算出相应的参数．     

有限域的子空间表示及其应用

本文研究了有限域在其子域上向量子空间的表示问题,推广了文献[3]中的一个结果,并给出了关于Singer差集的一个构造性证明；最后,利用有限域的所有超平面作为集合,构作了一类结合方案,并计算了它们的参数.     

Paley type group schemes and planar Dembowski–Ostrom polynomials

In this paper we give some necessary and sufficient conditions for Dembowski–Ostrom polynomials to be planar. These conditions give a simple explanation of the Coulter–Matthews and Ding–Yin commutative semifields and enable us to obtain permutation polynomials from some of the Zha–Kyureghyan–Wang commutative semifields. We then give a generalization of Feng’s construction of Paley type group schemes in extra-special p-groups of exponent p and construct a family of Paley type group schemes in what we call the flag groups of finite fields. We also determine the strong multiplier groups of these group schemes. In the last section of this paper, we give a straightforward generalization of the twin prime power construction of difference sets to a construction of Hadamard designs from twin Paley type association schemes.     

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.     

Classification of three-class association schemes using backtracking with dynamic variable ordering

We describe several techniques for the exhaustive computer generation of non-isomorphic association schemes with a given set of intersection numbers using a backtracking algorithm with forward checking and dynamic variable ordering. We have applied these techniques to the classification of certain open parameter sets for three-class association schemes listed by Van Dam in (Three-class association schemes, J. Algebraic Combin. 10 (1999) 69–107) for which we present several new results. Among these are some new (imprimitive) distance regular graphs of diameter 3.     

Cyclic homology for schemes

Using hypercohomology, we can extend cyclic homology from algebras to all schemes over a ring . By `extend' we mean that the usual cyclic homology of any commutative algebra agrees with the cyclic homology of its corresponding affine scheme.

     

特征为2的奇异二次面上3个类和4个类结合方案的几何构作(英文)

利用特征为２的有限域上射影空间,我们构作了一些三个类和４个类的结合方案,并计算了它们的参数．     

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.     

Difference set constructions of DRADs and association schemes

Doubly Regular Asymmetric Digraphs (DRAD) with rank 4 automorphism groups were previously thought to be rare. We exhibit difference sets in Galois Rings that can be used to construct an infinite family of DRADs with rank 4 automorphism groups. In addition, we construct difference sets in groups for all r?2 that can be used to construct DRADs and nonsymmetric 3-class imprimitive association schemes. Finally, we prove a new product construction for difference sets so that the resulting difference sets can be used to build nonsymmetric 3-class imprimitive association schemes.     

Commutative Standard Table Algebras with at Most One Nontrivial Multiplicity

We classify commutative standard table algebras (STA) with at most one nontrivial multiplicity. The main result shows that there exists exactly one nontrivial multiplicity if and only if the table basis is the wreath product of a two-dimensional subalgebra and an abelian group. The theorem applies to adjacency algebras of commutative association schemes with exactly one primitive idempotent matrix of rank greater than one. A theorem of Seitz that characterizes finite groups with exactly one irreducible representation of degree greater than one is another corollary of the main theorem.