Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T23:16:46.117Z Has data issue: false hasContentIssue false

Concerning Difference Sets

Published online by Cambridge University Press:  20 November 2018

T. G. Ostrom*
Affiliation:
Montana State University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A set of integers {a0, a1, … , an} is said to be a difference set modulo N if the set of differences {ai — aj (i,j = 0, 1, … , n) contains each non-zero residue mod N exactly once. It follows that N and n are connected by the relation N = n2 + n + 1. If {a0, a1 …an} is a difference set mod N, so is the set {a0 + s, a1 + s, … , an + s} (s = 0, 1, … , N). These difference sets form a finite projective plane of N points, with each difference set constituting a line in the plane.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1953