A characterization of P- and Q-polynomial association schemes
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.
- scientific article; zbMATH DE number 619549
- A characterization of \(Q\)-polynomial association schemes
- Parameters of association schemes that are both P- and Q-polynomial
- Characterizations of regularity for certain \(Q\)-polynomial association schemes
- On nonsymmetric P- and Q-polynomial association schemes
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
- Some algebra related to P- and Q-polynomial association schemes
- New families of \(Q\)-polynomial association schemes
- Association schemes with multiple Q-polynomial structures
- \(P\)- and \(\mathcal Q\)-polynomial association schemes and their antipodal \(P\)- polynomial covers
- Characerization of a class of distance regular graphs.
- Characterization of H(n,q) by the parameters
- Characterization of projective graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 45992 (Why is no real title available?)
- scientific article; zbMATH DE number 3521848 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- scientific article; zbMATH DE number 3296351 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Parameters of association schemes that are both P- and Q-polynomial
- Root systems and the Johnson and Hamming graphs
- Some q-Krawtchouk Polynomials on Chevalley Groups
- The classification of distance-regular graphs of type IIB
- There are finitely many Q-polynomial association schemes with given first multiplicity at least three
- Distance-regular digraphs of girth 4
- Balanced sets and Q-polynomial association schemes
- P and Q polynomial schemes with \(q=-1\)
- On nonsymmetric P- and Q-polynomial association schemes
- Designs as maximum codes in polynomial metric spaces
- Spectra of bipartite \(P\)- and \(Q\)-polynomial association schemes
- A new inequality for distance-regular graphs
- Association schemes with multiple Q-polynomial structures
- A note on thin \(P\)-polynomial and dual-thin \(Q\)-polynomial symmetric association schemes
- Leonard pairs from 24 points of view.
- Leaves in representation diagrams of bipartite distance-regular graphs
- A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- A matrix equation for association schemes
- Kite-free \(P\)- and \(Q\)-polynomial schemes
- Kite-free distance-regular graphs
- Twice Q-polynomial distance-regular graphs are thin
- A note on association schemes with two \(\text{P}\)-polynomial structures of type III
- Character products and \(Q\)-polynomial group association schemes
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- On the isomorphism of certain primitive \(Q\)-polynomial not \(P\)-polynomial association schemes
- Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras
- The Norton algebra of a \(Q\)-polynomial distance-regular graph
- A duality of scaffolds for translation association schemes
- Energy bounds for codes in polynomial metric spaces
- Nonexistence of exceptional 5-class association schemes with two \(Q\)-polynomial structures
- Two linear transformations each tridiagonal with respect to an eigenbasis of the other; the TD-D canonical form and the LB-UB canonical form
- Some algebra related to P- and Q-polynomial association schemes
- Polynomial properties on large symmetric association schemes
- scientific article; zbMATH DE number 3950544 (Why is no real title available?)
- A spectral equivalent condition of the P-polynomial property for association schemes
- On Q-polynomial association schemes of small class
- Extremal 1-codes in distance-regular graphs of diameter 3
- scientific article; zbMATH DE number 1867222 (Why is no real title available?)
- On pseudo-distance-regularity
- Two linear transformations each tridiagonal with respect to an eigenbasis of the other
- Vanishing conditions on parameters for P(Q)-polynomial association schemes
- On association schemes generated by a relation or an idempotent
- Quantum isomorphism of graphs from association schemes
- A characterization of Leonard pairs using the notion of a tail
- New parameters of subsets in polynomial association schemes
- Parameters of quotient-polynomial graphs
- Projective geometries, Q-polynomial structures, and quantum groups
- \(P\)- and \(\mathcal Q\)-polynomial association schemes and their antipodal \(P\)- polynomial covers
- The subconstituent algebra of an association scheme. I
- The S₃-symmetric tridiagonal algebra
- The Norton-balanced condition for Q-polynomial distance-regular graphs
- Parameters of association schemes that are both P- and Q-polynomial
- On strongly closed subgraphs with diameter two and the Q-polynomial property
- On a new family of (P and Q)-polynomial schemes
This page was built for publication: A characterization of \(P\)- and \(Q\)-polynomial association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1114694)
