Association schemes for diagonal groups

Sean Eberhard commented on my posts on diagonal groups (see here and here). He is correct; there is an association scheme preserved by the full diagonal group with n factors in the socle; it is non-trivial if n > 2. The details take a few pages to write out but the basic idea is completely fine.

This shows that an AS-free group (one which does not preserve a non-trivial association scheme) must be either 2-homogeneous or almost simple. Clearly every 2-homogeneous group is AS-free; there are almost simple examples, but they are rather strange and no pattern has emerged thus far.

I hope a preprint will go on the arXiv sometime soon. But you read it first here (in Sean’s comments over the last few days).

About Peter Cameron

I count all the things that need to be counted.
This entry was posted in open problems and tagged , , , . Bookmark the permalink.

1 Response to Association schemes for diagonal groups

  1. The paper is now on the arXiv: .
    As a bonus, we construct an association scheme (a refinement of the above) from the Latin hypercube consisting of all n-tuples of elements of a group G with product equal to the identity. This was previously known only for abelian groups if n>2.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.