Enumerating extensions of mutually orthogonal Latin squares (Q2004974)

In this paper, the authors establish that the logarithm of the number of ways a \(k\)-MOLS of order \(n\) can be extended to a \((k+1)\)-MOLS, with \(0\leq k\leq n-2\), is at most \[n^2\int_0^1\log(1+(n-1)t^{k+2})dt.\] They generalize indeed this bound for the ways to extend a nearly orthogonal array by one column and hence, for the more general class of gerechte designs. Based on the asymptotic behavior of such bounds, the authors establish some upper bounds for the total number of \(k\)-MOLS of order \(n\), when \(k\) grows with \(n\). Some illustrative constructions are described and some related open problems concerning orthogonal mates of Latin squares, affine and projective planes, and mutually orthogonal Sudoku squares are enumerated.