The Open UniversitySkip to content
 

Pairwise balanced designs on $4s+1$ points with longest block of cardinality $2s$

Allston, J. L.; Grannell, M. J.; Griggs, T. S. and Stanton, R. G. (2000). Pairwise balanced designs on $4s+1$ points with longest block of cardinality $2s$. Utilitas Mathematica, 58, pp. 97–107.

Google Scholar: Look up in Google Scholar

Abstract

The quantity $g^{(k)}(v)$ is the minimum number of blocks necessary in a pairwise balanced design on $v$ elements, subject to the condition that the longest block have cardinality $k$. When $k \ge (v-1)/2$, except for the case where $v \equiv 1$ (mod 4) and $k=(v-1)/2$, it is known that $g^{(k)}(v)=1+(v-k)(3k-v+1)/2$. The designs which achieve this bound contain, apart from the long block, only pairs and triples, all of which intersect the long block. This paper investigates the exceptional case where $v \equiv 1$(mod 4) and $k=(v-1)/2$. We prove that $PBD(v)$s with $g^{(k)}(v)$ blocks contain, apart from the long block, only pairs, triples, and quadruples, all of which intersect the long block. We also give a comprehensive description for the structure of the
$PBD(v)$s.

Item Type: Journal Article
ISSN: 0315-3681
Academic Unit/Department: Mathematics, Computing and Technology > Mathematics and Statistics
Item ID: 22791
Depositing User: Mike Grannell
Date Deposited: 18 Aug 2010 13:42
Last Modified: 02 Dec 2010 21:02
URI: http://oro.open.ac.uk/id/eprint/22791
Share this page:

Actions (login may be required)

View Item
Report issue / request change

Policies | Disclaimer

© The Open University   + 44 (0)870 333 4340   general-enquiries@open.ac.uk