### Abstract

A Kirkman square with index γ, latinicity μ, block size k, and v points, KSk(v; μ, γ), is a t × t array (t = γ(v - 1)/μ(k - 1)) defined on a v-set V such that (1) every point of V is contained in precisely μ cells of each row and column, (2) each cell of the array is either empty or contains a k-subset of V, and (3) the collection of blocks obtained from the non-empty cells of the array is a (v, k, γ)-BIBD. For μ = 1, the existence of a KSk (v; μ, γ) is equivalent to the existence of a doubly resolvable (v, k, γ)-BIBD. The spectrum of KS2(v; 1, 1) or Room squares was completed by Mullin and Wallis in 1975. In this paper, we determine the spectrum for a second class of doubly resolvable designs with γ = 1. We show that there exist KS3(v; 1, 1) for v ≡ 3 (mod 6), v = 3 and v ≥ 27 with at most 23 possible exceptions for v.

Original language | English (US) |
---|---|

Pages (from-to) | 169-196 |

Number of pages | 28 |

Journal | Designs, Codes, and Cryptography |

Volume | 26 |

Issue number | 1-3 |

DOIs | |

State | Published - Jan 1 2002 |

### Keywords

- Doubly resolvable
- Kirkman square
- Kirkman triple system
- Resolvable
- Steiner triple system

### ASJC Scopus subject areas

- Computer Science Applications
- Applied Mathematics

## Fingerprint Dive into the research topics of 'The existence of Kirkman squares-doubly resolvable (v, 3, 1)-BIBDs'. Together they form a unique fingerprint.

## Cite this

*Designs, Codes, and Cryptography*,

*26*(1-3), 169-196. https://doi.org/10.1023/a:1016513527747