Related papers: Amorphic association schemes with negative Latin s…

An association scheme is called amorphic if every possible fusion of relations gives rise to another association scheme. In earlier work, we showed that if an association scheme has at most one relation that is neither strongly regular of…

An association scheme is called amorphic if every possible fusion of relations gives rise to a fusion scheme. We call a pair of relations fusing if fusing that pair gives rise to a fusion scheme. We define the fusing-relations graph on the…

Combining results on quadrics in projective geometries with an algebraic interplay between finite fields and Galois rings, we construct the first known family of partial difference sets with negative Latin square type parameters in…

We generalize the construction of affine polar graphs in two different ways to obtain new partial difference sets and amorphic association schemes. The first generalization uses a combination of quadratic forms and uniform cyclotomy. In the…

Let X be a pseudocyclic association scheme in which all the nontrivial relations are strongly regular graphs with the same eigenvalues. We prove that the principal part of the first eigenmatrix of X is a linear combination of an incidence…

An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial…

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic…

The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group…

A Latin square of order $n$ with symbols $a_1,\ldots,a_n$ can be considered as a multiplication table for binary operation in the set $A=\{a_1,\ldots,a_n\}$. We prove that, if this operation is associative, then $A$ is a group.

The action of $PGL(2,2^m)$ on the set of exterior lines to a nonsingular conic in $PG(2,2^m)$ affords an association scheme, which was shown to be pseudocyclic in Hollmann's thesis in 1982. It was further conjectured in Hollmann's thesis…

A \emph{Latin square} is a matrix of symbols such that each symbol occurs exactly once in each row and column. A Latin square $L$ is \emph{row-Hamiltonian} if the permutation induced by each pair of distinct rows of $L$ is a full cycle…

We construct a pair of non-commutative rank 8 association schemes from a rank 3 non-symmetric association scheme. For the pair, two association schemes have the same character table but different Frobenius-Schur indicators. This situation…

Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (b) to identify the design goals one should have in mind for…

An association scheme is called partially metric if it has a connected relation whose distance-two relation is also a relation of the scheme. In this paper we determine the symmetric partially metric association schemes with a multiplicity…

For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…

There exists two types of nonassociative algebras whose associator satisfies a symmetric relation associated with a 1-dimensional invariant vector space with respect to the natural action of the symmetric group on three elements. The first…

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

We can obtain a non-symmetric class $2$ association scheme by a skew-Hadamard matrix. We begin with a skew-Hadamard matrix of order $n$, construct a skew-Hadamard matrix of order $2n$ by doubling construction, and a non-symmetric class $2$…

The set of subspaces of a given dimension in an attenuated space has a structure of a symmetric association scheme and this association scheme is called an association scheme based on an attenuated space. Association schemes based on…