## Abstract In this paper, we study the problem of constructing sets of __s__ latin squares of order __m__ such that the average number of different ordered pairs obtained by superimposing two of the __s__ squares in the set is as large as possible. We solve this problem (for all __s__) when __m__
On the spectrum of critical sets in latin squares of order 2n
β Scribed by Diane Donovan; James LeFevre; G. H. John van Rees
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 197 KB
- Volume
- 16
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Suppose that L is a latin square of order m and PβββL is a partial latin square. If L is the only latin square of order m which contains P, and no proper subset of P has this property, then P is a critical set of L. The critical set spectrum problem is to determine, for a given m, the set of integers t for which there exists a latin square of order m with a critical set of size t. We outline a partial solution to the critical set spectrum problem for latin squares of order 2^n^. The back circulant latin square of even order m has a wellβknown critical set of size m^2^/4, and this is the smallest known critical set for a latin square of order m. The abelian 2βgroup of order 2^n^ has a critical set of size 4^n^β3^n^, and this is the largest known critical set for a latin square of order 2^n^. We construct a set of latin squares with associated critical sets which are intermediate between the back circulant latin square of order 2^n^ and the abelian 2βgroup of order 2^n^. Β© 2007 Wiley Periodicals, Inc. J Combin Designs 16: 25β43, 2008
π SIMILAR VOLUMES
## Abstract A critical set is a partial latin square that has a unique completion to a latin square, and is minimal with respect to this property. Let __scs__(__n__) denote the smallest possible size of a critical set in a latin square of order __n__. We show that for all __n__, $scs(n)\geq n\lfloo