12 KiB
| title | chunk | source | category | tags | date_saved | instance |
|---|---|---|---|---|---|---|
| Association scheme | 1/3 | https://en.wikipedia.org/wiki/Association_scheme | reference | science, encyclopedia | 2026-05-05T09:48:58.210111+00:00 | kb-cron |
The theory of association schemes arose in statistics, in the theory of experimental design for the analysis of variance. In mathematics, association schemes belong to both algebra and combinatorics. In algebraic combinatorics, association schemes provide a unified approach to many topics, for example combinatorial designs and the theory of error-correcting codes. In algebra, the theory of association schemes generalizes the character theory of linear representations of groups.
== Definition == An n-class association scheme consists of a set X together with a partition S of X × X into n + 1 binary relations, R0, R1, ..., Rn which satisfy:
R
0
=
{
(
x
,
x
)
:
x
∈
X
}
{\displaystyle R_{0}=\{(x,x):x\in X\}}
; it is called the identity relation. Defining
R
∗
:=
{
(
x
,
y
)
:
(
y
,
x
)
∈
R
}
{\displaystyle R^{*}:=\{(x,y):(y,x)\in R\}}
, if R in S, then R* in S. If
(
x
,
y
)
∈
R
k
{\displaystyle (x,y)\in R_{k}}
, the number of
z
∈
X
{\displaystyle z\in X}
such that
(
x
,
z
)
∈
R
i
{\displaystyle (x,z)\in R_{i}}
and
(
z
,
y
)
∈
R
j
{\displaystyle (z,y)\in R_{j}}
is a constant
p
i
j
k
{\displaystyle p_{ij}^{k}}
depending on
i
{\displaystyle i}
,
j
{\displaystyle j}
,
k
{\displaystyle k}
but not on the particular choice of
x
{\displaystyle x}
and
y
{\displaystyle y}
. An association scheme is commutative if
p
i
j
k
=
p
j
i
k
{\displaystyle p_{ij}^{k}=p_{ji}^{k}}
for all
i
{\displaystyle i}
,
j
{\displaystyle j}
and
k
{\displaystyle k}
. Most authors assume this property. 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. A symmetric association scheme is one in which each
R
i
{\displaystyle R_{i}}
is a symmetric relation. That is:
if (x, y) ∈ Ri, then (y, x) ∈ Ri. (Or equivalently, R* = R.) Every symmetric association scheme is commutative. Two points x and y are called ith associates if
(
x
,
y
)
∈
R
i
{\displaystyle (x,y)\in R_{i}}
. The definition states that if x and y are ith associates then so are y and x. Every pair of points are ith associates for exactly one
i
{\displaystyle i}
. Each point is its own zeroth associate while distinct points are never zeroth associates. If x and y are kth associates then the number of points
z
{\displaystyle z}
which are both ith associates of
x
{\displaystyle x}
and jth associates of
y
{\displaystyle y}
is a constant
p
i
j
k
{\displaystyle p_{ij}^{k}}
.
=== Graph interpretation and adjacency matrices === A symmetric association scheme can be visualized as a complete graph with labeled edges. The graph has
v
{\displaystyle v}
vertices, one for each point of
X
{\displaystyle X}
, and the edge joining vertices
x
{\displaystyle x}
and
y
{\displaystyle y}
is labeled
i
{\displaystyle i}
if
x
{\displaystyle x}
and
y
{\displaystyle y}
are
i
{\displaystyle i}
th associates. Each edge has a unique label, and the number of triangles with a fixed base labeled
k
{\displaystyle k}
having the other edges labeled
i
{\displaystyle i}
and
j
{\displaystyle j}
is a constant
p
i
j
k
{\displaystyle p_{ij}^{k}}
, depending on
i
,
j
,
k
{\displaystyle 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
{\displaystyle p_{ii}^{0}=v_{i}}
edges labeled
i
{\displaystyle i}
;
v
i
{\displaystyle v_{i}}
is the valency of the relation
R
i
{\displaystyle R_{i}}
. There are also loops labeled
0
{\displaystyle 0}
at each vertex
x
{\displaystyle x}
, corresponding to
R
0
{\displaystyle R_{0}}
. The relations are described by their adjacency matrices.
A
i
{\displaystyle A_{i}}
is the adjacency matrix of
R
i
{\displaystyle R_{i}}
for
i
=
0
,
…
,
n
{\displaystyle i=0,\ldots ,n}
and is a v × v matrix with rows and columns labeled by the points of
X
{\displaystyle X}
.
(
A
i
)
x
,
y
=
{
1
,
if
(
x
,
y
)
∈
R
i
,
0
,
otherwise.
(
1
)
{\displaystyle \left(A_{i}\right)_{x,y}={\begin{cases}1,&{\mbox{if }}(x,y)\in R_{i},\\0,&{\mbox{otherwise.}}\end{cases}}\qquad (1)}
The definition of a symmetric association scheme is equivalent to saying that the
A
i
{\displaystyle A_{i}}
are v × v (0,1)-matrices which satisfy
I.
A
i
{\displaystyle A_{i}}
is symmetric, II.
∑
i
=
0
n
A
i
=
J
{\displaystyle \sum _{i=0}^{n}A_{i}=J}
(the all-ones matrix), III.
A
0
=
I
{\displaystyle 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
{\displaystyle A_{i}A_{j}=\sum _{k=0}^{n}p_{ij}^{k}A_{k}=A_{j}A_{i},i,j=0,\ldots ,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
{\displaystyle A_{i}}
contain
v
i
{\displaystyle v_{i}}
1
{\displaystyle 1}
's:
A
i
J
=
J
A
i
=
v
i
J
.
(
2
)
{\displaystyle A_{i}J=JA_{i}=v_{i}J.\qquad (2)}
=== Terminology === The numbers
p
i
j
k
{\displaystyle p_{ij}^{k}}
are called the parameters of the scheme. They are also referred to as the structural constants.