This web page is devoted to difference triangle sets.

Following Klove (T. Klove, "Bounds on the Size of Optimal Difference Triangle Sets", IEEE Transactions on Information Theory, 34(1988), p. 355-361.) we define an (I,J) difference triangle set, T, as a set of integers {a(i,j) | 1 <= i <= I, 0 <= j <= J} such that all the differences a(i,j)-a(i,k), 1 <= i <= I, 0 <= k < j <= J are positive and distinct.

In other words T is a set of I Golomb rulers with J+1 marks each, which have no common difference.

Let m = m(T) be the maximum difference. Let M(I,J)=min{m(T)|T is an (I,J) difference triangle set}.

- Lower bounds for M(I,J)
- Upper bounds for M(I,J)
- Some optimal difference triangle sets
- Some difference triangle set programs
- Most wanted list - easiest unsettled values of M(I,J)

**
[
IBM Research home page |
James B. Shearer's home page |
Up
]
[
IBM home page |
Order |
Search |
Contact IBM |
Legal
]
**