✦ LIBER ✦

A family of symmetric designs

✍ Scribed by J.D. Fanning

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 228 KB
Volume: 146
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00072-5

No coin nor oath required. For personal study only.

✦ Synopsis

An embedding theorem for certain quasi-residual designs is proved and is used to construct a series of symmetric designs with v = (1 + 16 + ... + 16")9 + 16 "+~, k =(1 + 16 + ... + 16m)9, and 2 = (1 + 16 + ... + 16m-~)9 + 16".3, for a non-negative integer m.

📜 SIMILAR VOLUMES

A family of symmetric block designs

✍ Albert Leon Whiteman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 152 KB

A New Family of Symmetric 2-(v, k, λ) Bl

A New Family of Symmetric 2-(v, k, λ) Block Designs

✍ Edward Spence 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 169 KB

An infinite family of symmetric designs

✍ Christopher J. Mitchell 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 363 KB

In this paper, using the construction method of [3], we show that if q > 2 is a prime power such that there exists an afhne plane of order q -1, then there exists a strongly divisible 2 -((q -l)(qh -l), qh-'(q -l), qh-') design for every h 2 2. We show that these quasi-residual designs are embeddabl

Factorizations of symmetric designs

✍ D de Caen; D.A Gregory 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 753 KB

A characterization of the extensions of

A characterization of the extensions of symmetric designs

✍ A Baartmans; M.S Shrikhande 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Let D be a quasi-symmetric design with block intersection numbers 0 and y. For any fixed block B of D, let D B denote the incidence structure whose points are the points of D not in B and whose blocks are the blocks of D disjoint from B. If D is an extension of a symmetric design, Cameron showed tha

A family of resolvable regular graph des

A family of resolvable regular graph designs

✍ Donald L. Kreher; Gordon F. Royle; W.D. Wallis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 278 KB

A regular graph design RGD (v, k; r) is a design on v points with blocks of size k and constant replication number r, such that any two points belong to either )~1 or 21 + 1 common blocks, for some constant 2~. We investigate resolvable regular graph designs with block size 4. In particular we deter