Intersection numbers of Sudoku latin squares

Abstract

Let $n=hw$, where $h$ and $w$ are integers with $h,w\ge 2$. We determine the set of possible intersection numbers of two $n\times n$ latin squares having the additional `Sudoku' constraint based on a $w\times h$ grid of $h\times w$ boxes.