AssociationScheme2Configuration

Let R be a relation matrix of an association scheme of order n, and let P be a partition of [1..n]. IsCoherentConfiguration(R, P) returns the configuration determined by R and P.

We will show an example.

gap> R := CompleteGraphScheme(6);;
gap> CC := AssociationScheme2Configuration(R, [[1],[2,3,4,5,6]]);;
gap> Display(CC);
[ [  0,  1,  1,  1,  1,  1 ],
  [  2,  3,  4,  4,  4,  4 ],
  [  2,  4,  3,  4,  4,  4 ],
  [  2,  4,  4,  3,  4,  4 ],
  [  2,  4,  4,  4,  3,  4 ],
  [  2,  4,  4,  4,  4,  3 ] ]
gap> IsCoherentConfiguration(CC);
true