𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A family of 4-designs with block size 9

✍ Scribed by Jürgen Bierbrauer

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
204 KB
Volume
138
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

We construct a family of simple 4-designs with parameters 4-(2:+ 1,9, 84), (f, 6)= 1, f>~5.

📜 SIMILAR VOLUMES

On c-Bhaskar Rao designs with block size
On c-Bhaskar Rao designs with block size 4
✍ Malcolm Greig; Spencer P. Hurd; Judson S. McCranie; Dinesh G. Sarvate 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 203 KB 👁 1 views

## Abstract Several new families of __c__‐Bhaskar Rao designs with block size 4 are constructed. The necessary conditions for the existence of a __c__‐BRD (υ,4,λ) are that: (1)λ~min~=−λ/3 ≤ __c__ ≤ λ and (2a) __c__≡λ (mod 2), if υ > 4 or (2b) __c__≡ λ (mod 4), if υ = 4 or (2c) __c__≠ λ − 2, if υ =

On packing designs with block size 5 and
On packing designs with block size 5 and index 4
✍ Ahmed M. Assaf; Alan Hartman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 695 KB

A (u, k, ,I) packing design of order u, block size k, and index I is a collection of k-element subsets, called blocks, of a u-set, V, such that every 2-subset of V occurs in at most A blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve

On small packing and covering designs wi
On small packing and covering designs with block size 4
✍ Alan Hartman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 325 KB

A packing (respectively covering) design of order v, block size k, and index ~ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most (at least) 3. blocks. The packing (covering) problem is to determine the maximum (minimum) number of bloc

Self-converse Mendelsohn designs with bl
Self-converse Mendelsohn designs with block size 4t + 2
✍ Qingde Kang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 603 KB

A Mendelsohn design MD(v, k, λ) is a pair (X, B) where X is a v-set together with a collection B of cyclic k-tuples from X such that each ordered pair from X, as adjacent entries, is contained in exactly λk-tuples of B. The existence of SCMD(v, 3, λ) and SCMD(v, 4, 1) has been settled by us. In thi