On transversals of homogeneous Latin squares
Matematičeskie voprosy kriptografii, Tome 6 (2015) no. 3, pp. 5-17
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider homogeneous Latin squares, i.e. Latin squares of order $2n$ with elements from $\{0,\dots,2n-1\}$ such that after reducing modulo $n$ we obtain $2n\times2n$-matrix consisting of four identical Latin squares of order $n$. The set of all transversals of homogeneous Latin squares is described in a general case; homogeneous Latin squares of order 10 are considered in more detail.
[1] Sachkov V. N., Vvedenie v kombinatornye metody diskretnoi matematiki, MTsNMO, M., 2004
[2] C. J. Colbourn, J. H. Dinitzm (eds.), Handbook of combinatorial designs, 2nd ed., Chapman Hall/CRC Press, 2006 | MR
[3] Borisenko V. V., “O transversalyakh raspavshikhsya latinskikh kvadratov chetnogo poryadka”, Matematicheskie voprosy kriptografii, 5:1 (2014), 5–25