Partitioning 3-homogeneous Latin bitrades (Q2427434): Difference between revisions

A Latin bitrade \((T_1,J_2)\) is a pair of disjoint partial Latin squares that define the difference between some Latin squares \(L_1\) and \(L_2\), where \(L_1 \supseteq T_1\) and \(L_2 \supseteq T_2\). A Latin bitrade is called 3-homogeneous if it has 3 elements in each row, 3 elements in each column and each symbol appears exactly 3 times. In the paper under review, the author gives a new proof of a result of \textit{N. J. Cavenagh} [Commentat. Math. Univ. Carol. 47, No. 2, 337--358 (2006; Zbl 1138.05007)] which states that a 3-homogeneous Latin bitrade can be partitioned into three transversals. Some relations to finite representations of certain triangle groups are also discussed.