✦ LIBER ✦

On representing block designs in terms of their automorphisms

✍ Scribed by A Baartmans; K.J Danhof

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 455 KB
Volume: 20
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90026-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On symmetric block designs (40, 13, 4) w

On symmetric block designs (40, 13, 4) with automorphisms of order 5

✍ Vladimir Ćepulić 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 806 KB

On arcs in path designs of block size fo

On arcs in path designs of block size four

✍ Gaetano Quattrocchi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 513 KB

On arcs in path designs of block size 3

✍ Salvatore Milici 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 332 KB

On splitting sets in block designs and f

On splitting sets in block designs and finding roots of polynomials

✍ P.C. Van Oorschot; S.A. Vanstone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 1006 KB

The general notion of t-splitting sets is introduced within the context of combinatorial block designs. A greatest lower bound on cardinality of such sets, and an upper bound on cardinality of the smallest such set in a given design are established. The abstraction of t-splitting sets is shown to pr

On exact distributions of rank tests for

On exact distributions of rank tests for ordered alternatives in block designs

✍ Stephen Black; H. Mansouri 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 510 KB

On complexity of representing permutatio

On complexity of representing permutations of symmetric semigroups in terms of the elements of the system of generators

✍ Yu. V. Golunkov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 142 KB