A matrix equation for association schemes

L. Chihara; D. Stanton

doi:10.1007/BF01929479

A matrix equation for association schemes

L. Chihara, D. Stanton

School of Mathematics

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Let[Figure not available: see fulltext.] be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices T such that (PT)³ =I. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming scheme) are classified.

Original language	English (US)
Pages (from-to)	103-108
Number of pages	6
Journal	Graphs and Combinatorics
Volume	11
Issue number	2
DOIs	https://doi.org/10.1007/BF01929479
State	Published - Jun 1995

Publisher link

10.1007/BF01929479

Find It

Find It at U of M Libraries

Cite this

@article{4fb377d796e34c509aa430566e468aae,

title = "A matrix equation for association schemes",

abstract = "Let[Figure not available: see fulltext.] be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices T such that (PT)3 =I. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming scheme) are classified.",

author = "L. Chihara and D. Stanton",

year = "1995",

month = jun,

doi = "10.1007/BF01929479",

language = "English (US)",

volume = "11",

pages = "103--108",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "2",

}

TY - JOUR

T1 - A matrix equation for association schemes

AU - Chihara, L.

AU - Stanton, D.

PY - 1995/6

Y1 - 1995/6

N2 - Let[Figure not available: see fulltext.] be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices T such that (PT)3 =I. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming scheme) are classified.

AB - Let[Figure not available: see fulltext.] be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices T such that (PT)3 =I. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming scheme) are classified.

UR - http://www.scopus.com/inward/record.url?scp=0040119934&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040119934&partnerID=8YFLogxK

U2 - 10.1007/BF01929479

DO - 10.1007/BF01929479

M3 - Article

AN - SCOPUS:0040119934

SN - 0911-0119

VL - 11

SP - 103

EP - 108

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 2

ER -

A matrix equation for association schemes

Abstract

Publisher link

Find It

Other files and links

Fingerprint

Cite this