Pseudoku: A Sudoku Adjacency Algebra and Fractional Completion Threshold




Nimegeers, Kate

Journal Title

Journal ISSN

Volume Title



The standard Sudoku puzzle is a 9 × 9 grid partitioned into 3 × 3 square boxes and partially filled with symbols from the set {1, 2, ..., 9}, with the goal of the puzzle being to complete the grid so that each symbol appears once and only once in each row, column, and box. We study generalized Sudoku puzzles, set on an n × n grid with cells partitioned into n boxes (sometimes called cages) of height h and width w such that hw = n. Throughout this work, these generalized Sudoku are referred to as (h, w)-Sudoku when h and w are significant, but as simply Sudoku otherwise. The goal of solving a partially filled (h, w)-Sudoku puzzle remains the same; complete the Sudoku by assigning placements in the grid to each symbol from {1, 2, ..., hw} so that each symbol appears once and only once in each row, column, and box. This thesis is specifically concerned with establishing conditions which guarantee a fractional Sudoku completion. A fractional Sudoku completion is an assignment of a set of weights to each symbol-cell incidence, representing the proportion of the symbol for that specific cell. The total weight of symbols for each cell must sum to one, and the sum of the weights for each symbol must be exactly one across the cells from each row, column, and box. These conditions still require a balanced distribution of symbols throughout the grid, but with considerably more flexibility than the typical Sudoku conditions. In order to apply graph theoretic techniques to the problem, we develop a 4-partite graph representation, GP , for a partial Sudoku, P . The 4 parts correspond to the rows, columns, symbols, and boxes of P , and the edges of GP indicate the conditions for a completed Sudoku that remain unsatisfied in P . We then introduce the concept of a tile: a 4-vertex subgraph of GP , which represents a valid symbol placement in P . Completing P is equivalent to decomposing the edges of GP into these tiles. We then use an edge-tile inclusion matrix to relate the existence of such a decomposition to the existence of an solution vector with {0, 1} entries for a specific linear system. It is here that we move to the fractional setting through a relaxation of what constitutes an acceptable solution to the linear system - specifically, we are satisfied with solution vectors for which all entries are non-negative. To find conditions that guarantee such a solution exists we study the Gram matrix of the edge-tile inclusion matrix for the empty (h, w)-Sudoku, denoted M. We show that M is symmetric and that each element of M corresponds to a pair of edges in the graph representation Ghw of the empty (h, w)-Sudoku grid. We then leverage the inherent symmetry of equivalence relations between these edges to establish a Sudoku adjacency algebra which contains M . This allows us to explicitly construct a generalized inverse for M . This generalized inverse, along with some applied perturbation theory, is used to show that given large enough h and w, the linear system for any sufficiently sparse partial (h, w)-Sudoku is a minor perturbation of the linear system for the empty (h, w) Sudoku, and therefore allows a fractional completion. After presenting this main result, we take a brief detour to consider the unique case of Sudoku puzzles with thin boxes, examining how fixing the box width variable w while allowing height h to grow asymptotically influences the density conditions necessary for fractional completion. We also give an overview of our exploratory use of the Schur complement for matrix decomposition. Although this method didn’t directly feed into our primary results, it was instrumental in the discovery of the equivalence relations we used to construct our Sudoku adjacency algebra. Finally, we explore the potential applicability of our methodologies to certain Sudoku variants and acknowledge the limitations inherent in our approach. In the appendices, we provide additional resources that complement the main body of our work. In Appendix A, we give a factorization of the Sudoku matrix M and its eigenvectors as Kronecker products for readers who wish to more directly compare our methodology to algebraic graph theory work done on Sudoku by other researchers. Appendix B presents a series of interactive and educational activities designed to introduce students to the basic principles of Latin squares in a fun spy-themed setting.



Mathematical Puzzles, Sudoku Completion, Fractional Completion, Sudoku Adjacency Algebra, Spectral Decomposition, Graph Theory, Perturbation Theory, Latin Squares, Combinatorial Mathematics, Algebraic Graph Theory, Coherent Configurations, Sudoku Kronecker Products, Math Outreach and Education