With Michael Kinyon I wrote a paper investigating latin squares with the maximum possible number of 3x3 subsquares. van Rees showed that you can never have more than n2(n-1)/18 subsquares of order 3 in a latin square of order n. Moreover, he conjectured that this bound is achievable only when n is a power of 3.
In our paper we found a number of algebraically interesting loops/quasigroups whose Cayley tables achieve the van Rees bound. Here they are:
If you want to know what format this file is in, it is my usual latin squares format. The van Rees loops of order 27 that we found, in the order that they are in the file, are as follows. For each we give a 3-vector G which specifies the orders of the automorphism, autotopism and autoparatopism groups respectively.
Back to main data homepage.