Difference basis systems (Q1092908): Difference between revisions

Let \(\Delta\) (S) be the set of positive differences of all pairs of elements in a set of integers S. The author studies collections of n-sets of integers \(\{A_ 1,...,A_ h\}\) such that \(| A_ 1\cup...\cup A_ h| =k\) and \(\{\) 1,...,t\(\}\subseteq \Delta A_ 1\cup...\cup \Delta A_ h\). He calls such a collection a (k,h,n) difference basis system for t (here shortened to a (k,h,n) DBS for t). Given n and t, let \(k=s_ n(t)\) be the smallest value of k such that a (k,h,n) DBS for t exists for some h. Then let \(k=m_ n(t)\) be the smallest value of h such that an \((s_ n(t),h,n)\) DBS for t exists. The author proves that for a fixed n, \((\{s_ n(t)\}^ 2/t:\) \(t=1,2,...)\) and \((m_ n(t)/t:\) \(t=1,2,...)\) tend to limits \(\sigma_ n\) and \(\mu_ n\) say. The author shows for a fixed n and sufficiently large t one can construct an (s,m,n) DBS for t with s near \(s_ n(t)\sigma_ n\) and m near \(m_ n(t)\mu_ n\). The motivation for studying this problem comes from radioastronomy. It has to do with positioning movable antennas along a linear track so that various distances occur.