Association scheme

Definition

An n-class association scheme consists of a set X together with a partition S of X × X into n + 1 binary relations, R₀, R₁, ..., R_n which satisfy:

R 0 = { ( x , x ) : x ∈ X } and is called the Identity relation.

Defining R ∗ := { ( x , y ) | ( y , x ) ∈ R } , if R in S, then R* in S

If ( x , y ) ∈ R k , the number of z ∈ X such that ( x , z ) ∈ R i and ( z , y ) ∈ R j is a constant p i j k depending on i , j , k but not on the particular choice of x and y .

An association scheme is commutative if p i j k = p j i k for all i , j and k . Most authors assume this property.

A symmetric association scheme is one in which each relation R i is a symmetric relation. That is:

if (x,y) ∈ R_i, then (y,x) ∈ R_i . (Or equivalently, R* = R.)

Every symmetric association scheme is commutative.

Note, however, that while the notion of an association scheme generalizes the notion of a group, the notion of a commutative association scheme only generalizes the notion of a commutative group.

Two points x and y are called i th associates if ( x , y ) ∈ R i . The definition states that if x and y are i th associates so are y and x. Every pair of points are i th associates for exactly one i . Each point is its own zeroth associate while distinct points are never zeroth associates. If x and y are k th associates then the number of points z which are both i th associates of x and j th associates of y is a constant p i j k .

Graph interpretation and adjacency matrices

An association scheme can be visualized as a complete graph with labeled edges. The graph has v vertices, one for each point of X , and the edge joining vertices x and y is labeled i if x and y are i th associates. Each edge has a unique label, and the number of triangles with a fixed base labeled k having the other edges labeled i and j is a constant p i j k , depending on i , j , k but not on the choice of the base. In particular, each vertex is incident with exactly p i i 0 = v i edges labeled i ; v i is the valency of the relation R i . There are also loops labeled 0 at each vertex x , corresponding to R 0 .

The relations are described by their adjacency matrices. A i is the adjacency matrix of R i for i = 0 , … , n and is a v × v matrix with rows and columns labeled by the points of X .

( A i ) x , y = { 1 , if  ( x , y ) ∈ R i , 0 , otherwise. ( 1 )

The definition of an association scheme is equivalent to saying that the A i are v × v (0,1)-matrices which satisfy

I. A i is symmetric,II. ∑ i = 0 n A i = J (the all-ones matrix),III. A 0 = I ,IV. A i A j = ∑ k = 0 n p i j k A k = A j A i , i , j = 0 , … , n .

The (x, y)-th entry of the left side of (IV) is the number of paths of length two between x and y with labels i and j in the graph. Note that the rows and columns of A i contain v i 1 's:

A i J = J A i = v i J . ( 2 )

Terminology

The numbers p i j k are called the parameters of the scheme. They are also referred to as the structural constants.

History

The term association scheme is due to (Bose & Shimamoto 1952) but the concept is already inherent in (Bose & Nair 1939). These authors were studying what statisticians have called partially balanced incomplete block designs (PBIBDs). The subject became an object of algebraic interest with the publication of (Bose & Mesner 1959) and the introduction of the Bose–Mesner algebra. The most important contribution to the theory was the thesis of P. Delsarte (Delsarte 1973) who recognized and fully used the connections with coding theory and design theory. Generalizations have been studied by D. G. Higman (coherent configurations) and B. Weisfeiler (distance regular graphs).

Basic facts

p 00 0 = 1 , i.e. if ( x , y ) ∈ R 0 then x = y and the only z such that ( x , z ) ∈ R 0 is z = x

∑ i = 0 k p i i 0 = | X | , this is because the R i partition X .

The Bose–Mesner algebra

The adjacency matrices A i of the graphs ( X , R i ) generate a commutative and associative algebra A (over the real or complex numbers) both for the matrix product and the pointwise product. This associative, commutative algebra is called the Bose–Mesner algebra of the association scheme.

Since the matrices in A are symmetric and commute with each other, they can be diagonalized simultaneously. Therefore, A is semi-simple and has a unique basis of primitive idempotents J 0 , … , J n .

There is another algebra of ( n + 1 ) × ( n + 1 ) matrices which is isomorphic to A , and is often easier to work with.

Examples

The Johnson scheme, denoted J(v,k), is defined as follows. Let S be a set with v elements. The points of the scheme J(v,k) are the ( v k ) subsets of S with k elements. Two k-element subsets A, B of S are i th associates when their intersection has size k − i.

The Hamming scheme, denoted H(n,q), is defined as follows. The points of H(n,q) are the qⁿ ordered n-tuples over a set of size q. Two n-tuples x, y are said to be i th associates if they disagree in exactly i coordinates. E.g., if x = (1,0,1,1), y = (1,1,1,1), z = (0,0,1,1), then x and y are 1st associates, x and z are 1st associates and y and z are 2nd associates in H(4,2).

A distance-regular graph, G, forms an association scheme by defining two vertices to be i th associates if their distance is i.

A finite group G yields an association scheme on X = G , with a class R_g for each group element, as follows: for each g ∈ G let R g = { ( x , y ) | x = g ∗ y } where ∗ is the group operation. The class of the group identity is R₀. This association scheme is commutative if and only if G is abelian.

A specific 3-class association scheme:

Let A(3) be the following association scheme with three associate classes on the set X = {1,2,3,4,5,6}. The (i,j) entry is s if elements i and j are in relation R_s.

Coding theory

The Hamming scheme and the Johnson scheme are of major significance in classical coding theory.

In coding theory, association scheme theory is mainly concerned with the distance of a code. The linear programming method produces upper bounds for the size of a code with given minimum distance, and lower bounds for the size of a design with a given strength. The most specific results are obtained in the case where the underlying association scheme satisfies certain polynomial properties; this leads one into the realm of orthogonal polynomials. In particular, some universal bounds are derived for codes and designs in polynomial-type association schemes.

In classical coding theory, dealing with codes in a Hamming scheme, the MacWilliams transform involves a family of orthogonal polynomials known as the Krawtchouk polynomials. These polynomials give the eigenvalues of the distance relation matrices of the Hamming scheme.