On t-distance sets of (0, �1)-vectors

Abstract

We consider sets of (0, +1)-vectors in R n, having exactly s non-zero positions. In some cases we give best or nearly best possible bounds for the maximal number of such vectors if all the pairwise scalar products belong to a fixed set D of integers. The investigated cases include D={ -d, d}, which corresponds to equiangular lines.