An excess theorem for spherical 2-designs

DOI10.1007/S10623-012-9677-3zbMATH Open1245.05137arXiv1203.3257OpenAlexW2000870803MaRDI QIDQ438890FDOQ438890

Authors: Hirotake Kurihara 

Publication date: 31 July 2012

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

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.

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

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

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)

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Polynomial properties on large symmetric association schemes
• New spherical \((2 s + 1)\)-designs from Kuperberg's set: an experimental result
• 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
• Title not available (Why is that?)

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)