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.     

A construction of non-isomorphic amorphous association schemes from pseudo-cyclic association schemes

As a continuation of my paper [T. Fujisaki, A construction of amorphous association scheme from a pseudo-cyclic association scheme, Discrete Math. 285(1–3) (2004) 307–311], we show a construction of amorphous association scheme which is a fusion scheme of a direct product of two pseudo-cyclic association schemes with same first eigenmatrix. By using this construction, we can get at most three amorphous association scheme. We prove that if two pseudo-cyclic association scheme are non-isomorphic, then these three amorphous association schemes are mutually non-isomorphic.     

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.     

Divisible design digraphs and association schemes

Divisible design digraphs are constructed from skew balanced generalized weighing matrices and generalized Hadamard matrices. Commutative and non-commutative association schemes are shown to be attached to the constructed divisible design digraphs.     

A category of association schemes

We define a category of association schemes and investigate its basic properties. We characterize monomorphisms and epimorphisms in our category. The category is not balanced. The category has kernels, cokernels, and epimorphic images. The category is not an exact category, but we consider exact sequences. Finally, we consider a full subcategory of our category and show that it is equivalent to the category of finite groups.     

Negative Latin square type partial difference sets and amorphic association schemes with Galois rings

A partial difference set (PDS) having parameters (n², r(n?1), n+r²?3r, r²?r) is called a Latin square type PDS, while a PDS having parameters (n², r(n+1), ?n+r²+3r, r² +r) is called a negative Latin square type PDS. There are relatively few known constructions of negative Latin square type PDSs, and nearly all of these are in elementary abelian groups. We show that there are three different groups of order 256 that have all possible negative Latin square type parameters. We then give generalized constructions of negative Latin square type PDSs in 2‐groups. We conclude by discussing how these results fit into the context of amorphic association schemes and by stating some open problems. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 266‐282, 2009     

Investigations on association schemes with elementary abelian thin residue

In this paper, we give a new class of association schemes whose thin residues are isomorphic to an elementary abelian $p$-group of order $p^2$. We then study the automorphism groups of these schemes and determine whether these schemes are schurian.     

On spherical designs obtained from Q‐polynomial association schemes

We characterize that the image of the embedding of the Q ‐polynomial association scheme into the first eigenspace by primitive idempotent E ₁ is a spherical t‐design in terms of the Krein numbers. Furthermore, we show that the strengths of P‐ and Q‐polynomial schemes as spherical designs are bounded by a constant. Copyright © 2011 John Wiley & Sons, Ltd. 19:167‐177, 2011     

Classification of skew‐Hadamard matrices of order 32 and association schemes of order 31

Using a backtracking algorithm along with an essential change to the rows of representatives of known 13 710 027 equivalence classes of Hadamard matrices of order 32, we make an exhaustive computer search feasible and show that there are exactly 6662 inequivalent skew‐Hadamard matrices of order 32. Two skew‐Hadamard matrices are considered SH ‐equivalent if they are similar by a signed permutation matrix. We determine that there are precisely 7227 skew‐Hadamard matrices of order 32 up to SH ‐equivalence. This partly settles a problem posed by Kim and Solé. As a consequence, we provide the classification of association schemes of order 31.     

On graphs with exactly one anti-adjacency eigenvalue and beyond

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers (2019) [9], we characterize all connected graphs with exactly one positive anti-adjacency eigenvalue, which is an analog of Smith's classical result that a connected graph has exactly one positive adjacency eigenvalue iff it is a complete multipartite graph. On this basis, we identify the connected graphs with all but at most two anti-adjacency eigenvalues equal to ?2 and 0. Moreover, for the anti-adjacency matrix we determine the HL-index of graphs with exactly one positive anti-adjacency eigenvalue, where the HL-index measures how large in absolute value may be the median eigenvalues of a graph. We finally propose some problems for further study.     

On class dimension of flat association schemes in affine and affine-symplectic spaces

In this paper, we obtain upper bounds of the class dimension of flat association schemes in affine and affine-symplectic spaces and construct resolving sets for these schemes.     

Connectedness of PBIB designs having asymmetrical association schemes

Summary A necessary and sufficient condition for the connectedness ofm-associate partially balanced incomplete block (PBIB) designs having an asymmetrical association scheme is given, only in terms of design parameters, without inner structure parameters of designs. Supported in part by Grant 321-6066-58530013 (Japan).     

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.     

A characterization of Q-polynomial association schemes

We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.     

Amorphic association schemes with negative Latin square-type graphs

Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative Latin square-type graphs and whose underlying set is a nonelementary abelian 2-group. We give a simple proof of a result of Hamilton that generalizes Brouwer's result. We use multiple distinct quadratic forms to construct amorphic association schemes with a large number of classes.     

Spin Models of Index 2 and Hadamard Models

A spin model (for link invariants) is a square matrix W with non-zero complex entries which satisfies certain axioms. Recently it was shown that ^t WW ^–1 is a permutation matrix (the order of this permutation matrix is called the index of W), and a general form was given for spin models of index 2. Moreover, new spin models, called non-symmetric Hadamard models, were constructed. In the present paper, we classify certain spin models of index 2, including non-symmetric Hadamard models.     

On association schemes with multiplicities 1 or a prime p

The main result of this paper gives a classification of commutative association schemes, all irreducible characters of which have multiplicity 1 or a prime p.     

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 association schemes all elements of which have valency 1 or 2

In the present note, we investigate schemes S in which each element s satisfies n_s2 and n_s^*s≠2. We show that such a scheme is schurian. More precisely, we show that it is isomorphic to G//t, where G is a finite group and t an involution of G weakly closed in C_G(t).

Groups G with an involution t weakly closed in C_G(t) have been described in Glauberman's Z^*-Theorem [G. Glauberman, Central elements in core-free groups, J. Algebra 4 (1966) 403–420] with the help of the largest normal subgroup of G having odd order.