|
Encyclopaedia of DesignTheory: Latin squares |
| General | Partition | Incidence | Array |
| Experimental | Other designs | Math properties | Stat properties |
| Server | External | Bibliography | Miscellanea |
The numbers of classes are given in the following table.
| Order | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| Isotopy classes | 1 | 1 | 2 | 2 | 22 | 564 | 1676267 |
| Main classes | 1 | 1 | 2 | 2 | 12 | 147 | 283657 |
M. T. Jacobson and P. Matthews, Generating uniformly distributed random Latin squares, J. Combinatorial Design 4 (1996), 405-437there is a Markov chain method for generating a random Latin square of given order. The limiting distribution of the Markov chain makes all Latin squares equally likely. However, little is known about the rate of convergence.
Table of contents | Glossary | Topics | Bibliography | History
Peter J. Cameron
2 August 2002