An excess theorem for spherical 2-designs

DOI10.1007/s10623-012-9677-3zbMath1245.05137arXiv1203.3257OpenAlexW2000870803MaRDI QIDQ438890

Hirotake Kurihara

Publication date: 31 July 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.3257

zbMATH Keywords

spherical design\(Q\)-polynomial association schemedistance set

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Polynomial properties on large symmetric association schemes ⋮ A general method to obtain the spectrum and local spectra of a graph from its regular partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of \(Q\)-polynomial association schemes
• A simple proof of the spectral excess theorem for distance-regular graphs
• The spectral excess theorem for distance-regular graphs: a global (over)view
• A survey on spherical designs and algebraic combinatorics on spheres
• Spherical codes and designs
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Polynomial spaces

This page was built for publication: An excess theorem for spherical 2-designs