Table of Contents
Fetching ...

Roux schemes which carry association schemes locally

Alexander L. Gavrilyuk, Jesse Lansdown, Akihiro Munemasa, Sho Suda

Abstract

A roux scheme is an association scheme formed from a special "roux" matrix and the regular permutation representation of an associated group. They were introduced by Iverson and Mixon for their connection to equiangular tight frames and doubly transitive lines. We show how roux matrices can be produced from association schemes and characterise roux schemes for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical. An important example arises from the $64$ equiangular lines in $\mathbb{C}^8$ constructed by Hoggar which we prove is unique (determined by its parameters up to isomorphism). We also characterise roux schemes by their eigenmatrices and provide new families of roux schemes using our construction.

Roux schemes which carry association schemes locally

Abstract

A roux scheme is an association scheme formed from a special "roux" matrix and the regular permutation representation of an associated group. They were introduced by Iverson and Mixon for their connection to equiangular tight frames and doubly transitive lines. We show how roux matrices can be produced from association schemes and characterise roux schemes for which the neighbourhood of a vertex induces an association scheme possessing the same number of relations as the thin radical. An important example arises from the equiangular lines in constructed by Hoggar which we prove is unique (determined by its parameters up to isomorphism). We also characterise roux schemes by their eigenmatrices and provide new families of roux schemes using our construction.

Paper Structure

This paper contains 10 sections, 15 theorems, 56 equations.

Key Result

Lemma 1.2

An association scheme is isomorphic to a roux scheme if and only if it is commutative and its thin radical acts regularly (by multiplication) on the other adjacency matrices, at least one of which is symmetric. $\blacktriangleleft$$\blacktriangleleft$

Theorems & Definitions (35)

  • Definition 1.1
  • Lemma 1.2: IversonMixon
  • proof : Proof of \ref{['eqn:triple']}, \ref{['eqn:triple2']}
  • Proposition 2.1
  • proof
  • Lemma 3.1: IversonMixon
  • Theorem 3.2
  • proof
  • Remark 3.3
  • Lemma 3.4
  • ...and 25 more