Fractions of permutations. An application to Sudoku

We study how to simplify fractional factorial design generation by exploiting the a priori knowledge that can be derived from the orthogonality constraints that the fractional factorial design itself must satisfy. We work on Sudoku puzzles that can be considered as a special case of Latin squares in the class of gerechte designs. We prove that the generation of a Sudoku is equivalent to that of a fraction of a proper set of permutations. We analyse both the 4×4 and the 9×9 Sudoku types.