A simple expression for triples of signs of group Latin squares is given; in particular we prove that it depends only on the order.
On the distance between distinct group Latin squares
โ Scribed by Diane Donovan; Sheila Oates-Williams; Cheryl E. Praeger
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 182 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
๐ 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
## 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 p
We present some new results on a well-known distance measure between evolutionary trees. The trees we consider are free 3-trees having n leaves labeled 0, . . . , n -1 (representing species), and n -2 internal nodes of degree 3. The distance between two trees is the minimum number of nearest neighbo
## 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__