Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > NOA EIDELSTEIN:
All reports by Author Noa Eidelstein:

TR10-120 | 27th July 2010
Noa Eidelstein, Alex Samorodnitsky

Lower bounds for designs in symmetric spaces

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 ... more >>>




ISSN 1433-8092 | Imprint