𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Several 2–(46, 6, 3) designs

✍ Scribed by Peter J. Cameron

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
140 KB
Volume
87
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A simple construction produces designs with the parameters of the title, which are extensions of the generalised quadrangle of order (4,2). The construction also works for two related parameter sets. A feature of the construction is the large number of non-isomorphic designs it produces.

📜 SIMILAR VOLUMES

There is no (46, 6, 1) block design
There is no (46, 6, 1) block design
✍ S.K. Houghten; L.H. Thiel; J. Janssen; C.W.H. Lam 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB
On 2-(45, 12, 3) designs
On 2-(45, 12, 3) designs
✍ R. Mathon; E. Spence 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 937 KB

Under the assumption that the incidence matrix of a 2-(45, 12, 3) design has a certain block structure, we determine completely the number of nonisomorphic designs involved. We discover 1136 such designs with trzvial automorphism group. In addition we analyze all 2-(45, 12, 3) designs having an auto

Enumeration of resolvable 2-(10, 5, 16)
Enumeration of resolvable 2-(10, 5, 16) and 3-(10, 5, 6) designs
✍ Luis B. Morales; Carlos Velarde 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

## Abstract A backtracking over parallel classes with a partial isomorph rejection (PIR) is carried out to enumerate the resolvable 2‐(10,5,16) designs. Computational results show that the inclusion of PIR reduce substantially the CPU time for the enumeration of all designs. We prove first some res

On 1-rotational Sλ(2, 3, ν) designs
On 1-rotational Sλ(2, 3, ν) designs
✍ Shinji Kuriki; Masakazu Jimbo 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 269 KB

In this paper, the necessary and sufficient condition for the existence of a 1-rotational Sx(2, 3, v) design is obtained, and it is shown that an Sx(2, 3, v) design, if it exists, can be always constructed cyclically

Balanced tournament designs and resolvab
Balanced tournament designs and resolvable (υ, 3, 2)-bibds
✍ E.R. Lamken; S.A. Vanstone 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 721 KB

In this paper, we present new constructions for resolvable and near resolvable (v, 3, 2)-BIBDs. These constructions use balanced tournament designs and odd balanced tournament designs. We then use balanced tournament designs with almost orthogonal resolutions and odd balanced tournament designs with