Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 169

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

A survey on spherical designs and algebraic combinatorics on spheres

Open access
Bannai, Eiichi, Bannai, Etsuko·2009·European Journal of Combinatorics

Abstract

This survey is mainly intended for non-specialists, though we try to include many recent developments that may interest the experts as well. We want to study ''good'' finite subsets of the unit sphere. To consider ''what is good'' is a part of our problem. We start with the definition of spherical t-designs on S^n^-^1 in R^n. After discussing some important examples, we focus on tight spherical t-designs on S^n^-^1. Tight t-designs have good combinatorial properties, but they rarely exist. So, we are interested in the finite subsets on S^n^-^1, which have properties similar to tight t-designs from the various viewpoints of algebraic combinatorics. For example, rigid t-designs, universally optimal t-codes (configurations), as well as finite sets which admit the structure of an association scheme, are among them. We will discuss various results on the existence and the non-existence of special spherical t-designs, as well as general spherical t-designs, and their constructions. We will discuss the relations between spherical t-designs and many other branches of mathematics. For example: by considering the spherical designs which are orbits of a finite group in the real orthogonal group O(n), we get many connections with group theory; by considering those which are shells of Euclidean lattices, we get many unexpected connections with number theory, such as modular forms and Lehmer's conjecture about the zeros of the Ramanujan @t function. Spherical t-designs and Euclidean t-designs are special cases of cubature formulas in approximation theory, and thus we get many connections with analysis and statistics, and in particular with orthogonal polynomials, and moment problems. Moreover, Delsarte's linear programming method and many recent generalizations, including the work of Musin and the subsequent progress in using semi-definite programming, have strong connections with geometry (in particular sphere packing problems) and the theory of optimizations. These various connections explain the reason of the charm of algebraic combinatorics on spheres. At the same time, these theories of spherical t-designs and related topics have strong roots in the developments of algebraic combinatorics in general, which was started as Delsarte theory of codes and designs in the framework of association schemes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.ejc.2008.11.007

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 2 references

Cited by

See all 169

Metadata

Authors
Bannai, E., & Bannai, E.
Venue
European Journal of Combinatorics
Publisher
Elsevier BV
Published
2009-08
Volume
30
Issue
6
Pages
1392-1425
ISSN
0195-6698 (ISSN-L)
OpenAlex
W2091491976
Cited by
169
References
2
FWCI
15.47
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A survey on spherical designs and algebraic combinatorics on spheres. https://app.cochat.ai/papers/10.1016/j.ejc.2008.11.007
The paper
Bannai, E., & Bannai, E. (2009). A survey on spherical designs and algebraic combinatorics on spheres. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2008.11.007

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.