Computing the sets of totally symmetric and totally conjugate orthogonal partial Latin squares by means of a SAT solver

Abstract

Conjugacy and orthogonality of Latin squares have been widely studied in the literature not only for their theoretical interest in combinatorics, but also for their applications in distinct fields as experimental design, cryptography or code theory, amongst others. This paper deals with a series of binary constraints that characterize the sets of partial Latin squares of a given order for which their six conjugates either coincide or are all of them distinct and pairwise orthogonal. These constraints enable us to make use of a SAT solver to enumerate both sets. As an illustrative application, it is also exposed a method to construct totally symmetric partial Latin squares that gives rise, under certain conditions, to new families of Lie partial quasigroup rings.