The resolvable 2-(14, 7, 12) designs are classified in a computer search: there are 1, 363, 486 such designs, 1, 360, 800 of which have trivial full automorphism group. Since every resolvable 2-(14, 7, 12) design is also a resolvable 3-(14, 7, 5) design and vice versa, the latter designs are simultaneously classified. The computer search utilizes the fact that these designs are equivalent to ce...

the main purpose of this paper is to introduce a concept of$l$-fuzzifying topological groups (here $l$ is a completelydistributive lattice) and discuss some of their basic properties andthe structures. we prove that its corresponding $l$-fuzzifyingneighborhood structure is translation invariant. a characterizationof such topological groups in terms of the corresponding$l$-fuzzifying neighborhoo...

There are 22521 nonisomorphic 2-(9,3,3) designs of which 9218 are decomposable and 395 resolvable. Computational methods used to find and analyse these designs are discussed. All cubic multigraphs on 8 vertices are displayed and their role in the generation process is outlined. Statistics are presented concerning neighborhood graphs, multiple blocks, parallel classes, subdesigns, group orders a...

Amongst resolvable incomplete block designs, affine resolvable designs are optimal in many conventional senses. However, different affine resolvable designs for the same numbers of treatments, replicates, and block size can differ in how well they estimate elementary treatment contrasts. An aberration criterion is employed to distinguish the best of the affine resolvable designs for this task. ...