No label defined (Q3976923)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 14398
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 14398

      Statements

      25 June 1992
      0 references
      distance matrix
      0 references
      association scheme
      0 references
      path matrix
      0 references
      Cayley graph
      0 references
      0 references
      Let \(Z\) be a finite, abelian group, and let \(\mathcal C\) be a subgroup of \(Z^ n\). Thus, \(\mathcal C\) is an additive code. If the distance matrix of \(\mathcal C\) has \(s+ 1\) distinct rows, where \(s\) is the external distance of \(\mathcal C\), then \textit{P. Delsarte} [Philips Res. Rep. Suppl. No. 10 (1973)] defined an association scheme on the set of translates of \(\mathcal C\). The author generalizes this construction to the setting of Cayley graphs by using the path matrix as a replacement for the distance matrix. Namely, given a Cayley graph \(X\) on a finite group \(G\), and given a normal subgroup \(N\) of \(G\), the path matrix \(C\) is defined by letting \(C_{x,i}\) be the number of paths of length \(i\) that start at the vertex \(x\) of \(X\) and end in \(N\). Under appropriate hypotheses, the author constructs an association scheme on \(G/N\) by defining an equivalence relation on \(G/N\): two cosets \(xN\) and \(yN\) are equivalent if the corresponding rows of the path matrix are equal.
      0 references

      Identifiers