A note on the number of different inner products generated by a finite set of vectors

This note aims to introduce a new problem in combinatorial geometry. What is the minimum number of distinct inner products determined by n distinct vectors in R d ? We use some elementary methods to derive upper and lower bounds giving a good impression of where the answer might lie and show how it is connected to various known problems.