✦ LIBER ✦

Pairwise orthogonal F-rectangle designs

✍ Scribed by W.T. Federer; A.S. Hedayat; J.P. Mandeli

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 577 KB
Volume: 10
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(84)90060-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Orthogonal F-rectangles, orthogonal arra

Orthogonal F-rectangles, orthogonal arrays, and codes

✍ Walter T Federer; John P Mandeli 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 735 KB

Minimal pairwise balanced designs

✍ R.G. Stanton 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Percentages in pairwise balanced designs

✍ Charles J. Colbourn; Vojtech Rődl 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Let K = {k,, , k,} be a set of block sizes, and let (pr, , p,} be nonnegative numbers with Cy!',,p, = 1. We prove the following theorem: for any E >O, if a (u, K, 1) pairwise balanced design exists and v is sufficiently large, then a (u, K, 1) pairwise balanced design exists in which the fraction

Coloured designs, new group divisible de

Coloured designs, new group divisible designs and pairwise balanced designs

✍ C.A. Rodger; Dinesh G. Sarvate; Jennifer Seberry 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 507 KB

Arrays for orthogonal designs

✍ H. Kharaghani 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

for some permutation ' of the set f1Y 2Y F F F Y 2ng. An in®nite number of arrays which are suitable for any amicable set of eight circulant matrices are introduced. Applications include new classes of orthogonal designs.

Minimal clique partitions and pairwise b

Minimal clique partitions and pairwise balanced designs

✍ Rolf Rees 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

We consider the problem of determining cp(G v KC), the smallest number of cliques required to partition the edge set of the graph G v K~, where G is a finite simple graph and K~, is the empty graph on m vertices. A lower bound on cp(G v K~,,,) is obtained which, when applied to the case G = K,, shar