On the relations of various conjectures on Latin squares and straightening coefficients
โ Scribed by Rosa Huang; Gian-Carlo Rota
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 620 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
We begin by discussing Dinitz's conjecture. Recall that a partial Latin square of order n is an n x n array of symbols with the property that no symbol appears more than once in any row or column. While a graduate student at Ohio State University, Jeff Dinitz proposed the following conjecture.
Conjecture 1 (Dinitz, 1978). Associate to each pair (i, j) where 1 <i, j<n a set S, of size n. Then there exists a partial Latin square (aij)lGi,jan with aijESij for all pairs (i,j).
๐ SIMILAR VOLUMES
Robustness in the various analysis of variance models should be assessed with regard to all the assumptions. Here we assess the etTect of the continuity assumption. The models considered were chosen because they are in a sense fragile, and the elTects might be anticipated to be more dramatic here. W
It is shown that given an odd prime p, the number of even latin squares of order p+1 is not equal to the number of odd latin squares of order p+1. This result is a special case of a conjecture of Alon and Tarsi and has implications for various other combinatorial problems, including conjectures of R