๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The minimum number of components in 4-regular perfect systems of difference sets

โœ Scribed by Anton Kotzig; Philip J Laufer

Book ID
107884989
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
139 KB
Volume
37
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Regular perfect systems of differences s
Regular perfect systems of differences sets
โœ 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
Regular Perfect Systems of Sets of Iterated Differences
โœ 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