Lower bounds for designs in symmetric spaces

Details Lower bounds for designs in symmetric spaces Lower bounds for designs in symmetric spaces

2010-07-21

arxiv.org/abs/1007.3546v2

Mathematics

Combinatorics

Abstract and introduction slightly expanded

Scientific paper

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower bounds on designs in spaces with a large group of symmetries. These spaces include globally symmetric Riemannian spaces (of any rank) and commutative association schemes with 1-transitive group of symmetries. Our bounds are, in general, implicit, relying on estimates on the spectral behavior of certain symmetry-invariant linear operators. They reduce to the first linear programming bound for designs in globally symmetric Riemannian spaces of rank 1 or in distance regular graphs. The proofs are different though, coming from viewpoint of abstract harmonic analysis in symmetric spaces. As a dividend we obtain the following geometric fact: a design is large because a union of "spherical caps" around its points "covers" the whole space.

Affiliated with

Also associated with

No associations

Rating

Lower bounds for designs in symmetric spaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lower bounds for designs in symmetric spaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lower bounds for designs in symmetric spaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183258