Association schemes for diagonal groups

Publication date 19 December 2019

Abstract: 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 most

| G |

parts, so is

p (n)

if

| G | g e n

; its parameters depend only on

n

and

| G |

. For

n = 2

, the association scheme is trivial, while for

n = 3

its relations are the Latin square graph associated with the Cayley table of

G

and its complement. A transitive permutation group

G

is said to be emph{AS-free} if there is no non-trivial association scheme admitting

G

as a group of automorphisms. A consequence of our construction is that an AS-free group must be either

2

-homogeneous or almost simple. We construct another association scheme, finer than the above scheme if

n > 3

, from the Latin hypercube consisting of

n

-tuples of elements of

G

with product the identity.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Association schemes for diagonal groups