Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes

Solving a Sudoku puzzle involves putting the symbols 1, . . . , 9 into the cells of a 9 × 9 grid partitioned into 3 × 3 subsquares, in such a way that each symbol occurs just once in each row, column, or subsquare. Such a solution is a special case of a gerechte design, in which an n×n grid is partitioned into n regions with n squares in each, and each of the symbols 1, . . . , n occurs once in each row, column, or region. Gerechte designs originated in statistical design of agricultural experiments, where they ensure that treatments are fairly exposed to localised variations in the field containing the experimental plots. In this paper we consider several related topics. In the first section, we define gerechte designs and some generalizations, and explain a computational technique for finding and classifying them. The second section looks at the statistical background, explaining how such designs are used for designing agricultural experiments, and what additional properties statisticians would like them to have. In the third section, we focus on a special class of Sudoku solutions which we call “symmetric”. They turn out to be related to some important topics in finite geometry over the 3-element field, and to ∗This research partially supported by NSF Grant Number DMS-0510625.

[1]  Peter J. Cameron,et al.  Projective and Polar Spaces , 1992 .

[2]  J. Hirschfeld Finite projective spaces of three dimensions , 1986 .

[3]  Newton E. Morton,et al.  Fisher, the life of a scientist. , 1979 .

[4]  D. J. Finney,et al.  Life of a Scientist , 1979, Asia-Pacific Biotech News.

[5]  Angela M. Dean,et al.  On general balance in row-column designs , 1991 .

[6]  Walter T. Federer,et al.  Experimental design : theory and application , 1956 .

[7]  J. P. Morgan Association Schemes: Designed Experiments, Algebra and Combinatorics , 2005 .

[8]  H. D. Patterson Generation of Factorial Designs , 1976 .

[9]  Frank Yates,et al.  THE COMPARATIVE ADVANTAGES OF SYSTEMATIC AND RANDOMIZED ARRANGEMENTS IN THE DESIGN OF AGRICULTURAL AND BIOLOGICAL EXPERIMENTS , 1939 .

[10]  Joachim Kunert,et al.  Some comments on gerechte designs. II ; randomization analysis, and other methods that allow for inter-plot dependence , 1991 .

[11]  Ray Hill,et al.  A First Course in Coding Theory , 1988 .

[12]  T. Speed,et al.  Balance in Designed Experiments with Orthogonal Block Structure , 1983 .

[13]  John A. Nelder,et al.  The analysis of randomized experiments with orthogonal block structure. II. Treatment structure and the general analysis of variance , 1965, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[14]  J. A. Nelder,et al.  The Combination of Information in Generally Balanced Designs , 1968 .

[15]  Joachim Kunert,et al.  Some comments on gerechte designs. I. Analysis for uncorrelated errors. , 1990 .

[16]  H. D. Patterson,et al.  Design Keys for Factorial Experiments , 1978 .

[17]  K. Russell,et al.  Connectedness and orthogonality in multi-factor designs , 1975 .

[18]  Leonard H. Soicher,et al.  GRAPE: A System for Computing with Graphs and Groups , 1991, Groups And Computation.