In combinatorics, a difference set is a subset D D of size k k of a group G G of order v v such that every non-identity element of G G can be expressed as a product d 1 d 2 − 1 d_{1}d_{2}^{-1} of elements of D D in exactly λ \lambda ways. Wikipedia