Related papers: Circulant association schemes on triples
Association schemes on triples (ASTs) are ternary analogues of classical association schemes, whose relations and adjacency algebras are ternary instead of binary. We provide a survey of the current progress in the study of ASTs,…
Association schemes on triples (ASTs) are 3-dimensional analogues of classical association schemes. If a group acts two-transitively on a set, the orbits of the action induced on the triple Cartesian product of that set yields an AST. By…
An association scheme on triples (AST) is a three-dimensional analogue of a classical association scheme. Similar to how a transitive group action produces a Schurian classical association scheme, a two-transitive group action produces an…
In this paper, we obtain classification results for higher-dimensional analogues of classical association schemes called association schemes on triples (ASTs). We present an algorithm that enumerates all ASTs on a fixed number of vertices…
Association schemes on triples (ASTs) are ternary analogues of classical association schemes. Analogous to Schurian association schemes, ASTs arise from the actions of two-transitive groups. In this paper, we obtain the sizes and third…
Ternary coherent configurations are, on the one hand, a special case of multidimensional coherent configurations introduced by L. Babai (2016), and, on the other hand, a natural generalization of association schemes on triples introduced by…
Circulant graphs are a widely studied family of graphs whose members possess varying amounts of symmetry. Although considerable progress has been made in finding the automorphism groups of circulant graphs under certain restrictions, a…
Tetravalent graphs admitting a half-arc-transitive subgroup of automorphisms, that is a subgroup acting transitively on its vertices and its edges but not on its arcs, are investigated. One of the most fruitful approaches for the study of…
Recent classification of $\frac{3}{2}$-transitive permutation groups leaves us with three infinite families of groups which are neither $2$-transitive, nor Frobenius, nor one-dimensional affine. The groups of the first two families…
Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…
An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we study 4-class skew-symmetric association schemes. In J. Ma [On the nonexistence of skew-symmetric…
This short paper presents characterisations of normal arc-transitive circulants and arc-transitive normal circulants, that is, for a connected arc-transitive circulant $\Gamma=\Cay(C,S)$, it is shown that 1. Aut(C,S) is transitive on S if…
In 1992, Terwilliger introduced the notion of the \emph{Terwilliger algebra} in order to study association schemes. The Terwilliger algebra of an association scheme $\mathcal{A}$ is the subalgebra of the complex matrix algebra, generated by…
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…
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…
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…
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…
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…
Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in…
A graph $\Gamma$ of even order is a bicirculant if it admits an automorphism with two orbits of equal length. Symmetry properties of bicirculants, for which at least one of the induced subgraphs on the two orbits of the corresponding…