Balanced sets and Q-polynomial association schemes
From MaRDI portal
(Redirected from Publication:1102296)
Recommendations
Cites work
- Binary polyhedral groups and Euclidean diagrams
- Characerization of a class of distance regular graphs.
- Characterization of H(n,q) by the parameters
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3704613 (Why is no real title available?)
- scientific article; zbMATH DE number 3437326 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Root systems and the Johnson and Hamming graphs
- Spherical codes and designs
- Tight spherical designs. I
- Tight Spherical Disigns, II
Cited in
(16)- A survey on spherical designs and algebraic combinatorics on spheres
- Association schemes with multiple Q-polynomial structures
- Leaves in representation diagrams of bipartite distance-regular graphs
- 2-homogeneous bipartite distance-regular graphs
- Tight distance-regular graphs
- On the connectivity of graphs in association schemes
- The Terwilliger algebra of a 2-homogeneous bipartite distance-regular graph
- Character products and \(Q\)-polynomial group association schemes
- Remarks on pseudo-vertex-transitive graphs with small diameter
- TD-pairs and the q-Onsager algebra
- scientific article; zbMATH DE number 2187720 (Why is no real title available?)
- An inequality on the cosines of a tight distance-regular graph
- A Higman inequality for regular near polygons
- 2-homogeneous bipartite distance-regular graphs and the quantum group \(U^\prime_q(\mathfrak{so}_6)\)
- The Norton-balanced condition for Q-polynomial distance-regular graphs
- The last subconstituent of the Hemmeter graph
This page was built for publication: Balanced sets and Q-polynomial association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102296)