Balanced sets and Q-polynomial association schemes

DOI10.1007/BF01864156zbMath0644.05016OpenAlexW2083787719MaRDI QIDQ1102296

Paul M. Terwilliger

Publication date: 1988

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01864156

zbMATH Keywords

classificationassociation schemes. projective geometrybalanced set of vectorsneighbour connectivity

Mathematics Subject Classification ID

Other designs, configurations (05B30) Connectivity (05C40)

Related Items

Remarks on pseudo-vertex-transitive graphs with small diameter ⋮ Association schemes with multiple Q-polynomial structures ⋮ A Higman inequality for regular near polygons ⋮ Leaves in representation diagrams of bipartite distance-regular graphs ⋮ The last subconstituent of the Hemmeter graph ⋮ Character products and \(Q\)-polynomial group association schemes ⋮ An inequality on the cosines of a tight distance-regular graph ⋮ TD-pairs and the $q$-Onsager algebra ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ 2-homogeneous bipartite distance-regular graphs ⋮ The Terwilliger algebra of a 2-homogeneous bipartite distance-regular graph ⋮ Tight distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Binary polyhedral groups and Euclidean diagrams
• Characterization of H(n,q) by the parameters
• Spherical codes and designs
• Tight spherical designs. I
• Root systems and the Johnson and Hamming graphs
• Characerization of a class of distance regular graphs.
• Tight Spherical Disigns, II