Packing Latin squares into sudoku puzzles

I have another new preprint, the result of a research project with UC Irvine undergraduate Cindy Zhang: “Sudoku grids that require many clues” (arXiv:2607.05728, to appear at JCDCG3 2026). The main result is, I think, surprising: When generalized to \(n^2\times n^2\) grids, almost all sudoku puzzles must be almost entirely covered by clues, leaving only a logarithmic fraction of cells blank. This…