𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved bounds for perfect systems of difference sets

✍ Scribed by D.G Rogers


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
541 KB
Volume
62
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On critical perfect systems of differenc
✍ D.G. Rogers πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 773 KB

A perfect system of difference sets with threshold c is a partition of a consecutive run of integers beginning with c into full difference sets of valency at least 2. The BKT inequality, due to Bermond, Kotzig and Turgeon gives a necessary condition for the existence of such systems; systems for whi

Regular perfect systems of differences s
✍ Anton Kotzig; Jean Turgeon πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 424 KB

\_xk, 113 6 k <j s I,) be thcit difference sets. We shah say that the system ,S = (S, S2,. . ,, S,) is perfect if Each D' is called a component of the system. A perfect system of difference sets is caifed regular if rl = r2 = ---= r, = r. We shall then speak of a perfect (I, s)-system. In this pape

Regular Perfect Systems of Sets of Itera
✍ G.M. Hamilton; I.T. Roberts; D.G. Rogers πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 192 KB

For s β‰₯ 2, a set {a(i, j) : 1 ≀ j ≀ s + 1i ≀ s} where a(1, j), 1 ≀ j ≀ s, are some prescribed integers and a(i + 1, j) = |a(i, j)a(i, j + 1)|, for 1 ≀ i < s and 1 ≀ j ≀ si, is called a set of iterated differences. Such a set has size s and is full if it contains s(s + 1)/2 distinct integers. Krewera