Contents

Towards Deciding the Existence of \(2-(22,8,4)\) Designs

Brendan D. McKay 1, Stanislaw P. Radziszowski2
1Department of Computer Science Australian National University Canberra, ACT 2601, Australia
2 Department of Computer Science Rochester Institute of Technology Rochester, NY 14623, USA

Abstract

We report on progress towards deciding the existence of \(2-(22, 8, 4)\) designs without assuming any automorphisms. Using computer algorithms, we have shown that in any such design every two blocks have nonempty intersection, every quadruple of points can occur in at most two blocks, and no three blocks can pairwise intersect in a single point.