A k\_n Latin rectangle is a k\_n matrix of entries from [1, 2, ..., n] such that no symbol occurs twice in any row or column. An intercalate is a 2\_2 Latin subrectangle. Let N(R) be the number of intercalates in R, a randomly chosen k\_n Latin rectangle. We obtain a number of results about the dist
Latin squares with one subsquare
β Scribed by I. M. Wanless
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 207 KB
- Volume
- 9
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We prove that for all odd **__m__**β₯**3** there exists a latin square of order 3 **__m__** that contains an (**__m__**β**1**) Γ **__m__** latin subrectangle consisting of entries not in any transversal. We prove that for all even **__n__**β₯**10** there exists a latin square of order **_
A simple expression for triples of signs of group Latin squares is given; in particular we prove that it depends only on the order.
## Abstract A __k__βplex in a Latin square of order __n__ is a selection of __kn__ entries in which each row, column, and symbol is represented precisely __k__ times. A transversal of a Latin square corresponds to the case __k__β=β1. We show that for all even __n__β>β2 there exists a Latin square o
In a latin square of order n, a k-plex is a selection of kn entries in which each row, column, and symbol occurs k times. A 1-plex is also called a transversal. A k-plex is indivisible if it contains no c-plex for 0<c<k. We prove that, for all n β₯ 4, there exists a latin square of order n that can b