The linear system for Sudoku and a fractional completion threshold
Combinatorics
2024-04-18 v3
Abstract
We study a system of linear equations associated with Sudoku latin squares. The coefficient matrix of the normal system has various symmetries arising from Sudoku. From this, we find the eigenvalues and eigenvectors of , and compute a generalized inverse. Then, using linear perturbation methods, we obtain a fractional completion guarantee for sufficiently large and sparse rectangular-box Sudoku puzzles.
Cite
@article{arxiv.2310.15279,
title = {The linear system for Sudoku and a fractional completion threshold},
author = {Peter J. Dukes and Kate Nimegeers},
journal= {arXiv preprint arXiv:2310.15279},
year = {2024}
}