made with Mathematica technology MathWorld

Difference Set Order

Let G be group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a (h,k,lambda)-difference set in G of order n=k-lambda.




CITE THIS AS:

Weisstein, Eric W. "Difference Set Order." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/DifferenceSetOrder.html

The Wolfram Demonstrations Project Browse Topics View Latest
JUST RELEASED: Wolfram Mathematica 7