Permutations of the positive integers with specified differences

In this paper, we show that given any finite set, D = {D-1, D-2,..., D-n}, of positive integers, with gcd (D-1, D-2,..., D-n) = 1, there is a permutation of the positive integers such that the absolute value of the difference between any two consecutive values is in D. Further, it is possible to choose the permutation so that each element of D occurs infinitely often as a difference. This answers in the affirmative a conjecture of Slater and Velez (1977, 1979).