A note on thin \(P\)-polynomial and dual-thin \(Q\)-polynomial symmetric association schemes

From MaRDI portal
Revision as of 15:42, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1383818

DOI10.1023/A:1008690026999zbMath0898.05084OpenAlexW1566189259MaRDI QIDQ1383818

Garth A. Dickie, Paul M. Terwilliger

Publication date: 15 October 1998

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008690026999




Related Items (22)

The subconstituent algebra of a strongly regular graphImprimitive Q-polynomial association schemesAssociation schemes with multiple Q-polynomial structuresA note on thin \(P\)-polynomial and dual-thin \(Q\)-polynomial symmetric association schemesThe subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint twoThe Terwilliger algebra of a distance-regular graph of negative typeA generalization of the Terwilliger algebraThe quantum adjacency algebra and subconstituent algebra of a graphThe Terwilliger algebra of the hypercubeThe Terwilliger algebra of an almost-bipartite \(P\)- and \(Q\)-polynomial association scheme\(Q\)-polynomial distance-regular graphs with \(a_1=0\) and \(a_2\neq 0\)Distance-regular graphs and the \(q\)-tetrahedron algebraA diagram associated with the subconstituent algebra of a distance-regular graphDistance-regular graphs of \(q\)-Racah type and the \(q\)-tetrahedron algebraAn inequality involving the local eigenvalues of a distance-regular graphDistance-regular graphs which support a spin model are thinThe Terwilliger algebras of bipartite \(P\)- and \(Q\)-polynomial schemes2-homogeneous bipartite distance-regular graphsHypercube and tetrahedron algebraThe subconstituent algebra of a distance-regular graph; thin modules with endpoint oneThe generalized Terwilliger algebra and its finite-dimensional modules when \(d=2\)Tight distance-regular graphs and the subconstituent algebra




Cites Work




This page was built for publication: A note on thin \(P\)-polynomial and dual-thin \(Q\)-polynomial symmetric association schemes