Using Volunteer Computing to Study Some Features of Diagonal Latin Squares

• Main Authors: Vatutin Eduard, Zaikin Oleg, Kochemazov Stepan, Valyaev Sergey
• Format: Article
• Language: English
• Published: De Gruyter 2017-12-01
• Series: Open Engineering
• Subjects: latin square; diagonal latin square; transversal; enumeration; orthogonality; sat; volunteer computing; boinc
• Online Access: https://doi.org/10.1515/eng-2017-0052

In this research, the study concerns around several features of diagonal Latin squares (DLSs) of small order. Authors of the study suggest an algorithm for computing minimal and maximal numbers of transversals of DLSs. According to this algorithm, all DLSs of a particular order are generated, and for each square all its transversals and diagonal transversals are constructed. The algorithm was implemented and applied to DLSs of order at most 7 on a personal computer. The experiment for order 8 was performed in the volunteer computing project Gerasim@home. In addition, the problem of finding pairs of orthogonal DLSs of order 10 was considered and reduced to Boolean satisfiability problem. The obtained problem turned out to be very hard, therefore it was decomposed into a family of subproblems. In order to solve the problem, the volunteer computing project SAT@home was used. As a result, several dozen pairs of described kind were found.