TOPICS
Search

Difference Set


A difference set is a set D of k elements of a group G of group order h such that the differences d_i-d_j with i!=j contain every nonzero element of G exactly lambda times. It is then called an (h,k,lambda)-difference set in G and has difference set order n=k-lambda. A difference set with lambda=1 is called a planar difference set. The quadratic residues in the finite field GF(11) form a difference set. If there is a difference set of size k in a group G, then 2(k; 2) must be a multiple of |G|-1, where (k; 2) is a binomial coefficient.

Gordon maintains an index of known difference sets.


See also

Bruck-Ryser-Chowla Theorem, First Multiplier Theorem, Perfect Difference Set, Planar Difference Set, Prime Power Conjecture, Set Difference

Explore with Wolfram|Alpha

References

Gordon, D. M. "The Prime Power Conjecture Is True for n<2000000." Elec. J. Combin. 1, No. 1, R6, 1-7, 1994. https://doi.org/10.37236/1186.Gordon, D. M. "La Jolla Difference Set Repository." http://www.ccrwest.org/diffsets/diff_sets/index.html.

Referenced on Wolfram|Alpha

Difference Set

Cite this as:

Weisstein, Eric W. "Difference Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/DifferenceSet.html

Subject classifications