A characterization of \(P\)- and \(Q\)-polynomial association schemes (Q1114694): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of H(n,q) by the parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters of association schemes that are both P- and Q-polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characerization of a class of distance regular graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of projective graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some q-Krawtchouk Polynomials on Chevalley Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classification of distance-regular graphs of type IIB / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root systems and the Johnson and Hamming graphs / rank
 
Normal rank

Latest revision as of 12:46, 19 June 2024

scientific article
Language Label Description Also known as
English
A characterization of \(P\)- and \(Q\)-polynomial association schemes
scientific article

    Statements

    A characterization of \(P\)- and \(Q\)-polynomial association schemes (English)
    0 references
    1987
    0 references
    Let \(Y=(X,(R_ i)\), \(0\leq i\leq d)\) be a symmetric \(d\)-class association scheme, with intersection numbers \(p^ h_{ij}\) and Krein parameters \(q^ h_{ij}\) (0\(\leq h,i,j\leq d)\), and for each \(i\) \((0\leq i\leq d)\) define the ith (reduced) intersection diagram \(D_ i\) (resp. representation diagram \(D^*_ i)\) on the nodes \(0,1,...,d\) drawing an undirected arc between any distinct \(h\), \(j\) for which \(p^ h_{ij}>0\) (resp. \(q^ h_{ij}>0)\). \(Y\) is called \(P\)-polynomial (resp. \(Q\)-polynomial) if some \(D_ i\) (resp. \(D^*_ i)\) is a path.We obtain pointwise semi-definite matrices \(G(i)\) and \(G(i)^*\) (0\(\leq i\leq d)\) that yield new inequalities for the \(p^ h_{ij}\) and \(q^ h_{ij}\). We show for each \(i\) \((0\leq i\leq d)\), \(D^*_ i\) being a forest, the vanishing of \(G(i)\), and the existence of a certain geometric representation of \(X\) are all equivalent. A similar result relates \(G(i)^*\) and \(D_ i\). Denoting by a leaf in any diagram a node adjacent to exactly one other, we show there is at most one leaf besides the \(O\)-node in any connected \(D^*_ i\) for a \(P\)-polynomial scheme. We combine this with the above results and get an interpretation of the \(Q\)-polynomial property for \(P\)-polynomial schemes. Finally, we use equations induced by the vanishing of some \(G(i)\) to obtain a simple proof of a theorem of D. Leonard, that the intersection numbers of a \(P\)- and \(Q\)-polynomial scheme can be found from 5 parameters.
    0 references
    symmetric d-class association scheme
    0 references
    pointwise semi-definite matrices
    0 references
    geometric representation
    0 references
    leaf
    0 references
    Q-polynomial property
    0 references
    P-polynomial schemes
    0 references

    Identifiers