An excess theorem for spherical 2-designs

DOI10.1007/S10623-012-9677-3MaRDI QIDQ438890zbMATH OpenOpenAlexFDO

Authors 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

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

Abstract: We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the excess. Here we give a characterization of Q-polynomial association schemes among spherical 2-designs.

Recommendations

• A simple proof of the spectral excess theorem for distance-regular graphs
• On spherical designs obtained from \(Q\)-polynomial association schemes
• On a version of the spectral excess theorem
• A spectral excess theorem for nonregular graphs
• On some approaches to the spectral excess theorem for nonregular graphs

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3634274 (Why is no real title available?)
• scientific article; zbMATH DE number 3407710 (Why is no real title available?)
• A characterization of \(Q\)-polynomial association schemes
• A simple proof of the spectral excess theorem for distance-regular graphs
• A survey on spherical designs and algebraic combinatorics on spheres
• From local adjacency polynomials to locally pseudo-distance-regular graphs
• Polynomial spaces
• Spherical codes and designs
• The spectral excess theorem for distance-regular graphs: a global (over)view

Cited in

(6)

• Polynomial properties on large symmetric association schemes
• New spherical (2 s + 1)-designs from Kuperberg's set: an experimental result
• scientific article; zbMATH DE number 2064331 (Why is no real title available?)
• A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs
• A general method to obtain the spectrum and local spectra of a graph from its regular partitions
• scientific article; zbMATH DE number 166092 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438890)